Efficient algorithms for minimal disjoint path problems on chordal graphs

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

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

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

zbMATH Keywords

networkalgorithmminimal pathscliquechordal graphsdisjoint paths

Mathematics Subject Classification ID

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

Related Items (3)

Exact Solution Algorithms for the Chordless Cycle Problem ⋮ Unnamed Item ⋮ An improved algorithm for the longest induced path problem on \(k\)-chordal graphs

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