Pages that link to "Item:Q1005234"
From MaRDI portal
The following pages link to The minimum spanning strong subdigraph problem is fixed parameter tractable (Q1005234):
Displaying 9 items.
- Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949) (← links)
- Minimum leaf out-branching and related problems (Q1035689) (← links)
- Path-contractions, edge deletions and connectivity preservation (Q1713475) (← links)
- \(k\)-distinct in- and out-branchings in digraphs (Q1747490) (← links)
- Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs (Q2305930) (← links)
- Basic Terminology, Notation and Results (Q3120433) (← links)
- Locally Semicomplete Digraphs and Generalizations (Q3120438) (← links)
- Minimum Leaf Out-Branching Problems (Q3511432) (← links)
- Path-Contractions, Edge Deletions and Connectivity Preservation (Q5111736) (← links)
