Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph

DOI10.1016/J.DAM.2005.03.010MaRDI QIDQ2576353zbMATH OpenOpenAlexFDO

Authors Mahnhoon Lee, Sridhar Radhakrishnan

Publication date 27 December 2005

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2005.03.010

zbMATH Keywords

doubly chordal graphdoubly perfect elimination ordering

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1234609
• scientific article; zbMATH DE number 1230485
• scientific article; zbMATH DE number 2086689
• Efficient parallel algorithms for doubly convex-bipartite graphs
• Efficient Parallel Algorithms for Chordal Graphs

Cites work

• A characterisation of rigid circuit graphs
• Doubly chordal graphs, steiner trees, and connected domination
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• scientific article; zbMATH DE number 3522018 (Why is no real title available?)
• scientific article; zbMATH DE number 751126 (Why is no real title available?)
• Parallel Merge Sort
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Triangulated graphs and the elimination process

Cited in

(3)

• Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs
• scientific article; zbMATH DE number 1234609 (Why is no real title available?)
• scientific article; zbMATH DE number 1230485 (Why is no real title available?)

This page was built for publication: Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph

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