scientific article; zbMATH DE number 140475

zbMATH Open0773.05073MaRDI QIDQ4028893FDOQ4028893

Authors: A. Srinivasa Rao, C. Pandu Rangan 

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

Recommendations

• Efficient reduction for path problems on circular-arc graphs
• Paths in interval graphs and circular arc graphs
• Induced disjoint paths in circular-arc graphs in linear time
• Induced disjoint paths in circular-arc graphs in linear time
• Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs

zbMATH Keywords

interval graphcircular-arc graphlinear algorithmsarcsparity path problemtwo path problemchordless paths

Mathematics Subject Classification ID

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

Cited In (6)

• Computing and counting longest paths on circular-arc graphs in polynomial time
• The domatic number problem
• A linear algorithms for the two paths problem on permutation graphs
• A polynomial algorithm for the parity path problem on perfectly orientable graphs
• Efficient reduction for path problems on circular-arc graphs
• Title not available (Why is that?)

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 Q4028893)