Efficient algorithms for minimal disjoint path problems on chordal graphs

DOI10.7151/DMGT.1012zbMATH Open0845.05084OpenAlexW2003538595MaRDI QIDQ4882587FDOQ4882587

Authors: C. P. Gopalakrishnan, C. R. Satyan, C. Pandu Rangan 

Publication date: 26 August 1996

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7f3bc531146c26d75e8095c3798690713515e128

Recommendations

• Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
• The \(k\)-disjoint paths problem on chordal graphs
• scientific article; zbMATH DE number 780786
• Parameterized complexity of set-restricted disjoint paths on chordal graphs
• On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems
• Efficient Algorithms for k-Disjoint Paths Problems on DAGs
• Complexity and approximation results for the min-sum and min-max disjoint paths problems
• On finding Min-Min disjoint paths
• scientific article; zbMATH DE number 871922
• An optimal time algorithm for minimum linear arrangement of chord graphs

zbMATH Keywords

networkalgorithmchordal graphscliquedisjoint pathsminimal paths

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Paths and cycles (05C38)

Cited In (5)

• Title not available (Why is that?)
• Exact Solution Algorithms for the Chordless Cycle Problem
• The \(k\)-disjoint paths problem on chordal graphs
• An improved algorithm for the longest induced path problem on \(k\)-chordal graphs
• Title not available (Why is that?)

This page was built for publication: Efficient algorithms for minimal disjoint path problems on chordal graphs

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