scientific article; zbMATH DE number 7205205
From MaRDI portal
Publication:5111880
DOI10.4230/LIPICS.IPEC.2017.21zbMATH Open1443.68131arXiv1708.04536MaRDI QIDQ5111880FDOQ5111880
Jan Arne Telle, O-joung Kwon, Lars Jaffke
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1708.04536
Title of this publication is not available (Why is that?)
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)
Cites Work
- Graph minors. XIII: The disjoint paths problem
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs
- Algorithms for maximum weight induced paths
- Graph-Theoretic Concepts in Computer Science
- Graph classes with structured neighborhoods and algorithmic applications
- Induced disjoint paths in AT-free graphs
- The Induced Disjoint Paths Problem
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- A width parameter useful for chordal and co-comparability graphs
- Hardness of computing width parameters based on branch decompositions over the vertex set
- The \(k\)-in-a-path problem for claw-free graphs
- The point-set embeddability problem for plane graphs
- Induced disjoint paths in circular-arc graphs in linear time
- Mim-width. III. Graph powers and generalized distance domination problems
Cited In (9)
- Mim-width. III. Graph powers and generalized distance domination problems
- Title not available (Why is that?)
- Mim-width. II. The feedback vertex set problem
- Title not available (Why is that?)
- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs
- On the tractability of optimization problems on \(H\)-graphs
- On exact solution approaches for the longest induced path problem
- Title not available (Why is that?)
- Mim-width. I. Induced path problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111880)