Weakly Triangulated Comparability Graphs
From MaRDI portal
Publication:4268887
DOI10.1137/S0097539797322334zbMath0937.05070MaRDI QIDQ4268887
Elaine M. Eschen, R. Sritharan, Ryan B. Hayward, Jeremy P. Spinrad
Publication date: 28 October 1999
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices ⋮ Order-sensitive domination in partially ordered sets and graphs ⋮ Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs
This page was built for publication: Weakly Triangulated Comparability Graphs
