Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs
From MaRDI portal
Publication:2494815
DOI10.1016/j.disopt.2005.11.001zbMath1089.05028OpenAlexW2081923266MaRDI QIDQ2494815
Anders Yeo, Gregory Gutin, Jörgen Bang-Jensen
Publication date: 30 June 2006
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2005.11.001
Programming involving graphs or networks (90C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)
Related Items (3)
Minimum cycle factors in quasi-transitive digraphs ⋮ Semicomplete Multipartite Digraphs ⋮ Quasi-Transitive Digraphs and Their Extensions
Cites Work
- Vertex heaviest paths and cycles in quasi-transitive digraphs
- Orientations of digraphs almost preserving diameter
- Steiner type problems for digraphs that are locally semicomplete or extended semicomplete
- Quasi‐transitive digraphs
- A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph
- Combinatorial optimization. Theory and algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs