Recognition of perfect elimination bipartite graphs

DOI10.1016/0020-0190(82)90101-6zbMath0505.68030OpenAlexW2077329883MaRDI QIDQ1836480

Yanyan Li

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90101-6

zbMATH Keywords

sparse matricesbipartite graphsrecognition algorithmbisimplicial edge

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

A note on perfect partial elimination ⋮ Unnamed Item ⋮ Bisimplicial edges in bipartite graphs ⋮ Recognizing quasi-triangulated graphs. ⋮ Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph ⋮ Recognizing Sparse Perfect Elimination Bipartite Graphs

Cites Work

• Unnamed Item
• An algorithm for testing chordality of graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Perfect Elimination and Chordal Bipartite Graphs
• Toward Characterization of Perfect Elimination Digraphs

This page was built for publication: Recognition of perfect elimination bipartite graphs