scientific article; zbMATH DE number 4117882

MaRDI QIDQ4732130zbMATH OpenFDO

Authors

Publication date 1988

zbMATH Keywords

chordal graphstwo path problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A linear algorithms for the two paths problem on permutation graphs
• An efficient algorithm for finding a two-pair, and its applications
• Efficient algorithms for minimal disjoint path problems on chordal graphs
• STACS 2004
• The \(k\)-disjoint paths problem on chordal graphs

Cited in

(8)

• A linear algorithm for the group path problem on chordal graphs
• Parameterized and Exact Computation
• A linear-time algorithm for finding an ambitus
• The \(k\)-disjoint paths problem on chordal graphs
• An improved algorithm for the longest induced path problem on \(k\)-chordal graphs
• Chordless paths through three vertices
• A linear algorithms for the two paths problem on permutation graphs
• Efficient reduction for path problems on circular-arc graphs

This page was built for publication:

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