Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
1 answer
1k views

Minimum spanning subgraph with at least one incoming and one outgoing edge

Given a single-component, directed acyclic graph with one source (vertex with only outgoing edges) and one sink (vertex with only incoming edges), I'd like to find a minimum spanning subgraph which ...
Alec Jacobson's user avatar