The Maximum Carpool Matching problem is a star packing problem in directed graphs. Formally, given a directed graph G = (V,A), a capacity function c : V → N, and a weight function w : A → R+, a carpool matching is a subset of arcs, M ⊆ A, such that every v ∈ V satisfies: (i) din M (v) · dout M (v) = 0, (ii) din M (v) ≤ c(v), and (iii) dout M (v) ≤ 1. A vertex v for which dout M (v) = 1 is a pas...

Binary oppositions are among the essential concepts and components of structuralism and linguistic and semiotic theories that are rooted in human ancient beliefs. One of the fundamental functions of the human mind is the creation of binary oppositions, which are seen in art and literature. The study of binary oppositions in literary works leads to a better understanding of them. This article is...