Note: An improved algorithm for the longest induced path problem on k-chordal graphs

Authors:
Tetsuya Ishizeki;Yota Otachi;Koichi Yamazaki
Affiliations:
Department of Computer Science, Gunma University, 1-5-1 Tenjin-cho, Kiryu zip:376-8515, Gunma, Japan;Department of Computer Science, Gunma University, 1-5-1 Tenjin-cho, Kiryu zip:376-8515, Gunma, Japan;Department of Computer Science, Gunma University, 1-5-1 Tenjin-cho, Kiryu zip:376-8515, Gunma, Japan
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 10
Cited 0

Introduction to algorithms

Introduction to algorithms
Finding large holes

Information Processing Letters
Treewidth for graphs with small chordality

Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Dually Chordal Graphs

SIAM Journal on Discrete Mathematics
Graph classes: a survey

Graph classes: a survey
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithms for maximum weight induced paths

Information Processing Letters
The Approximation of Maximum Subgraph Problems

ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
On the Number of Minimum Cuts in a Graph

SIAM Journal on Discrete Mathematics
Estimating all pairs shortest paths in restricted graph families: a unified approach

Journal of Algorithms

Quantified Score

Hi-index	0.05

Visualization

Abstract

Gavril [F. Gavril, Algorithms for maximum weight induced paths, Information Processing Letters 81 (2002) 203-208] showed that the length of a longest induced path for graphs having no induced cycles on more than k vertices can be computed in O(n^km) time where n and m denote the number of vertices and edges, respectively. In this paper, we present an O(n^k) time algorithm for the same problem.