Minimum cycle factors in quasi-transitive digraphs
From MaRDI portal
Publication:924641
DOI10.1016/j.disopt.2007.12.002zbMath1134.90045OpenAlexW2006549279MaRDI QIDQ924641
Morten Hegner Nielsen, Jörgen Bang-Jensen
Publication date: 16 May 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2007.12.002
complementary cyclespolynomial algorithmnetwork flowquasi-transitive digraphcycle factorirreducible cycle factor
Related Items (3)
Maximum size of digraphs with some parameters ⋮ Finding complementary cycles in locally semicomplete digraphs ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
Cites Work
- Complementary cycles of all lengths in tournaments
- On complementary cycles in locally semicomplete digraphs
- Finding complementary cycles in locally semicomplete digraphs
- The partition of a strong tournament
- Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
- Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs
- A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
- Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs
- Quasi‐transitive digraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Minimum cycle factors in quasi-transitive digraphs