scientific article; zbMATH DE number 1151797

MaRDI QIDQ4387703zbMATH OpenFDO

Authors Y. Daniel Liang

Publication date 19 October 1998

zbMATH Keywords

cocomparability graphscross-pair techniqueinterval graphslinear time algorithmmaximum weight independent set problempermutation graphstrapezoid graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On some algorithms and properties of comparability graphs
• On the power of graph searching for cocomparability graphs
• scientific article; zbMATH DE number 3908482
• scientific article; zbMATH DE number 4043898
• A new LBFS-based algorithm for cocomparability graph recognition
• Comparability graphs among cover-incomparability graphs
• Graph-Theoretic Concepts in Computer Science
• scientific article; zbMATH DE number 966717
• A linear-time algorithm for maximum-cardinality matching on cocomparability graphs
• A general comparative study of some aspects of graph isomorphism

Cited in

(2)

• On the power of graph searching for cocomparability graphs
• Algorithms and Computation

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