Pages that link to "Item:Q2765953"
From MaRDI portal
The following pages link to The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs (Q2765953):
Displaying 7 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- The minimum spanning strong subdigraph problem is fixed parameter tractable (Q1005234) (← links)
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- Multipartite tournaments: a survey (Q2463897) (← links)
- Locally Semicomplete Digraphs and Generalizations (Q3120438) (← links)
- Semicomplete Multipartite Digraphs (Q3120439) (← links)
- Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs (Q5222543) (← links)