23 research outputs found
Vertex heaviest paths and cycles in quasi-transitive digraphs.
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 arc from x and z or from z to x. Solving a conjecture by Bang-Jensen and Huang (1995), Gutin (1995) described polynomial algorithms for finding a Hamiltonian cycle and a Hamiltonian path (if it exists) in a QTD. The approach taken in that paper cannot be used to find a longest path or cycle in polynomial time. We present a principally new approach that leads to polynomial algorithms for finding vertex heaviest paths and cycles in QTDs with non-negative weights on the vertices. This, in particular, provides an answer to a question by N. Alon on longest paths and cycles in QTDs
LIPIcs, Volume 274, ESA 2023, Complete Volume
LIPIcs, Volume 274, ESA 2023, Complete Volum
枝刈りラベリング法による大規模グラフ上の体系的なクエリ処理
学位の種別: 課程博士審査委員会委員 : (主査)東京大学教授 小林 直樹, 東京大学教授 萩谷 昌己, 東京大学教授 須田 礼仁, 東京大学准教授 渋谷 哲朗, 東京大学教授 定兼 邦彦, 東京大学教授 岩田 覚University of Tokyo(東京大学