Skip to main content

All Questions

Filter by
Sorted by
Tagged with
15 votes
3 answers
613 views

Maximum matching in a graph with no "shortcuts"

For a directed acyclic graph (DAG) $G$, denote by $G^\star$ the undirected graph obtained from $G$ by ignoring direction of its arcs. Let $e(G)=e(G^\star)$ be the number of arcs in $G$ (or edges in $G^...
Max Alekseyev's user avatar