ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES
type: Item
instance of: scholarly article
title: ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES
zbMATH Open document ID: 1202.68291
DOI: 10.1142/S0129054107005054
author: Ryuhei Uehara
author: Yushi Uno
published in: International Journal of Foundations of Computer Science
publication date: 2011-01-06T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5833099
zbMATH Keywords: algorithmic graph theory
zbMATH Keywords: design and analysis of algorithms
zbMATH Keywords: graph classes
zbMATH Keywords: longest path problem
MaRDI profile type: Publication
cites work: Color-coding
cites work: Finding Hamiltonian circuits in proper interval graphs
cites work: Hamiltonian circuits in interval graph generalizations
cites work: Finding a Path of Superlogarithmic Length
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Graph Classes: A Survey
cites work: On computing a longest path in a tree
cites work: A note on Hamiltonian split graphs
cites work: The Hamiltonian circuit problem for circle graphs is NP-complete
cites work: Paths in interval graphs and circular arc graphs
cites work: Q4198056
cites work: Algorithmic graph theory and perfect graphs
cites work: Q3002852
cites work: On approximating the longest path in a graph
cites work: Finding Hamiltonian circuits in interval graphs
cites work: Bandwidth of chain graphs
cites work: An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
cites work: Bipartite permutation graphs with application to the minimum buffer size problem
cites work: Longest cycles in threshold graphs
cites work: HAMILTONian circuits in chordal bipartite graphs
cites work: Recognizing interval digraphs and interval bigraphs in polynomial time
cites work: A linear time recognition algorithm for proper interval graphs
cites work: Necessary conditions for Hamiltonian split graphs
cites work: An approximation algorithm for computing longest paths.
cites work: Bipartite permutation graphs
cites work: Q4782696
cites work: Node-Deletion Problems on Bipartite Graphs
full work available at URL: s0129054107005054
OpenAlex ID: W2058687965
description: scientific article