Chordal bipartite graphs and crowns

DOI10.1007/BF00334850zbMath0585.05018OpenAlexW2126123349WikidataQ39831636 ScholiaQ39831636MaRDI QIDQ1071029

Vincent Bouchitte

Publication date: 1985

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00334850

zbMATH Keywords

algorithmbipartite graphchordal graphselimination schemecycle-free ordered set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Paths and cycles (05C38)

Related Items (2)

Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices ⋮ Efficient polynomial algorithms for distributive lattices

Cites Work

• Stacks and splits of partially ordered sets
• Minimizing Setups for Cycle-Free Ordered Sets
• Perfect Elimination and Chordal Bipartite Graphs

This page was built for publication: Chordal bipartite graphs and crowns