Pages that link to "Item:Q1250108"
From MaRDI portal
The following pages link to Covering the edge set of a directed graph with trees (Q1250108):
Displaying 8 items.
- Covering directed graphs by in-trees (Q626455) (← links)
- Restricted covering of digraphs with arborescences (Q913812) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- An application of submodular flows (Q1119596) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- A Survey on Covering Supermodular Functions (Q2971606) (← links)
- Covering Directed Graphs by In-Trees (Q3511356) (← links)
- The Minimum Weight In-Tree Cover Problem (Q3627688) (← links)