Vertex heaviest paths and cycles in quasi-transitive digraphs
type: Item
instance of: scholarly article
title: Vertex heaviest paths and cycles in quasi-transitive digraphs
zbMATH Open document ID: 0876.05058
DOI: 10.1016/0012-365X(95)00318-Q
published in: Discrete Mathematics
publication date: 1997-11-25T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 1018631
zbMATH Keywords: longest cycles
zbMATH Keywords: digraph
zbMATH Keywords: Hamiltonian cycle
zbMATH Keywords: Hamiltonian path
zbMATH Keywords: longest path
zbMATH Keywords: polynomial algorithms
author: Jørgen Bang-Jensen
author: G. Gutin
MaRDI profile type: Publication
cites work: Quasi‐transitive digraphs
cites work: Q5523467
cites work: Q3097395
cites work: Q3291037
cites work: Finding a Longest Path in a Complete Multipartite Digraph
cites work: Q4325297
cites work: Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
cites work: Q4739657
cites work: Q3707420
full work available at URL: 0012-365x(95)00318-q
OpenAlex ID: W1987668728
description: scientific article; zbMATH DE number 1018631