Steiner type problems for digraphs that are locally semicomplete or extended semicomplete

DOI10.1002/jgt.10140zbMath1031.05057OpenAlexW4250937028MaRDI QIDQ4446892

Anders Yeo, Gregory Gutin, Jörgen Bang-Jensen

Publication date: 3 February 2004

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10140

zbMATH Keywords

digraphsweighted digraphssemicomplete digraphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Packing strong subgraph in digraphs ⋮ Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs ⋮ Locally Semicomplete Digraphs and Generalizations

This page was built for publication: Steiner type problems for digraphs that are locally semicomplete or extended semicomplete