Vertex heaviest paths and cycles in quas
✍
Jørgen Bang-Jensen; Gregory Gutin
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 381 KB
A digraph D is called a quasi-transitive digraph (QTD) if for any triple x,y,z of distinct vertices of D such that (x,y) and (y,z) are arcs of D there is at least one at': from x to z or from z to x. Solving a conjecture by Bangdensen and Huang (1995), Gutin (1995) described polynomial algorithms fo