Weakly Triangulated Comparability Graphs

DOI10.1137/S0097539797322334MaRDI QIDQ4268887zbMATH OpenFDO

Authors Elaine M. Eschen, Ryan Hayward, R. Sritharan, Jeremy P. Spinrad

Publication date 28 October 1999

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539797322334

zbMATH Keywords

algorithmcomparabilitypartial ordersweakly triangulated

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Algorithms for weakly triangulated graphs
• Optimizing weakly triangulated graphs
• Weakly triangulated graphs
• Recognizing weakly triangulated graphs by edge separability
• scientific article; zbMATH DE number 1617254

Cited in

(11)

• Optimizing weakly triangulated graphs
• Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices
• Algorithms for weakly triangulated graphs
• Recognizing weakly triangulated graphs by edge separability
• scientific article; zbMATH DE number 1617254 (Why is no real title available?)
• Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs
• Linear layouts of weakly triangulated graphs
• Generating weakly triangulated graphs
• scientific article; zbMATH DE number 1445284 (Why is no real title available?)
• Linear layouts of weakly triangulated graphs
• Order-sensitive domination in partially ordered sets and graphs

This page was built for publication: Weakly Triangulated Comparability Graphs

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