Mim-Width I. Induced path problems
Authors:
- Lars JaffkeLJLars Jaffke
- O-Joung KwonOKO-Joung Kwon
- Jan Arne TelleJTJan Arne Telle
Open Access
- 1 May 2020
- journal article
- conference paper
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 278, 153-168
Abstract
No abstract availableKeywords
Funding Information
- European Research Council
- Bergens Forskningsstiftelse
- National Research Foundation of Korea
This publication has 15 references indexed in Scilit:
- The k-in-a-Path Problem for Claw-free GraphsAlgorithmica, 2010
- An improved algorithm for the longest induced path problem on -chordal graphsDiscrete Applied Mathematics, 2008
- Width Parameters Beyond Tree-width and their ApplicationsThe Computer Journal, 2007
- Algorithms for maximum weight induced pathsInformation Processing Letters, 2002
- Algorithms for Vertex Partitioning Problems on Partial k-TreesSIAM Journal on Discrete Mathematics, 1997
- Hamiltonian circuits in chordal bipartite graphsDiscrete Mathematics, 1996
- Graph Minors .XIII. The Disjoint Paths ProblemJournal of Combinatorial Theory, Series B, 1995
- Polynomial Algorithms for Hamiltonian Cycle in Cocomparability GraphsSIAM Journal on Computing, 1994
- Finding Hamiltonian circuits in interval graphsInformation Processing Letters, 1985
- Hamilton Paths in Grid GraphsSIAM Journal on Computing, 1982