Edge-disjoint paths in permutation graphs

DOI10.7151/DMGT.1007MaRDI QIDQ4846686zbMATH OpenOpenAlexFDO

Authors C. P. Gopalakrishnan, C. Pandu Rangan

Publication date 30 November 2000

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

Full work available at URL https://semanticscholar.org/paper/46d5c04472d6ef8d7c4b8776dd3d7d381b93bbf1

zbMATH Keywords

edge-disjoint pathsgraphic algorithmspermutation graph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1555936
• Finding edge-disjoint paths in partial \(k\)-trees
• A linear algorithms for the two paths problem on permutation graphs
• Shortest two disjoint paths in polynomial time
• STACS 2004

Cited in

(1)

• scientific article; zbMATH DE number 1555936 (Why is no real title available?)

This page was built for publication: Edge-disjoint paths in permutation graphs

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