Induced disjoint paths in circular-arc graphs in linear time

DOI10.1007/978-3-319-12340-0_19MaRDI QIDQ2945192zbMATH OpenOpenAlexFDO

Authors Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen

Publication date 9 September 2015

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL http://dro.dur.ac.uk/14215/1/14215.pdf

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38)

Recommendations

• Induced disjoint paths in circular-arc graphs in linear time
• A linear time algorithm for the induced disjoint paths problem in planar graphs
• The Induced Disjoint Paths Problem
• Induced disjoint paths problem in a planar digraph
• Finding multiple induced disjoint paths in general graphs

Cited in

(4)

• Induced disjoint paths in claw-free graphs
• A linear time algorithm for the induced disjoint paths problem in planar graphs
• scientific article; zbMATH DE number 140475 (Why is no real title available?)
• Induced disjoint paths in circular-arc graphs in linear time

This page was built for publication: Induced disjoint paths in circular-arc graphs in linear time

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