Finding multiple induced disjoint paths in general graphs

DOI10.1016/J.IPL.2011.07.016MaRDI QIDQ1944193zbMATH OpenOpenAlexFDO

Authors Hong Gao, Jianzhong Li, Ke-Jia Zhang

Publication date 4 April 2013

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2011.07.016

zbMATH Keywords

approximation algorithmgraphinduced disjoint paths

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Graph-Theoretic Concepts in Computer Science
• Finding disjoint paths in split graphs
• Finding disjoint paths in split graphs
• The Induced Disjoint Paths Problem
• scientific article; zbMATH DE number 4089593
• Induced disjoint paths problem in a planar digraph
• Decomposing graphs into internally-disjoint induced paths
• Finding k Disjoint Paths in a Directed Planar Graph

Cites work

• Edge-disjoint paths in planar graphs with constant congestion
• scientific article; zbMATH DE number 5899246 (Why is no real title available?)
• scientific article; zbMATH DE number 1187149 (Why is no real title available?)
• scientific article; zbMATH DE number 1953167 (Why is no real title available?)
• Induced disjoint paths problem in a planar digraph
• Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
• On the disjoint paths problem
• The Induced Disjoint Paths Problem

Cited in

(3)

• Finding an induced path that is not a shortest path
• Induced disjoint paths in circular-arc graphs in linear time
• The Induced Disjoint Paths Problem

This page was built for publication: Finding multiple induced disjoint paths in general graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944193)