The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs
From MaRDI portal
Publication:2765953
DOI10.1006/jagm.2001.1174zbMath1002.68110MaRDI QIDQ2765953
Anders Yeo, Jörgen Bang-Jensen
Publication date: 1 August 2002
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.2001.1174
68R10: Graph theory (including graph drawing) in computer science
Related Items
Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs, An algorithmic metatheorem for directed treewidth, The minimum spanning strong subdigraph problem is fixed parameter tractable, Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs, Multipartite tournaments: a survey, Locally Semicomplete Digraphs and Generalizations, Semicomplete Multipartite Digraphs