Fast algorithms of dually chordal graphs

MaRDI QIDQ2794289zbMATH OpenFDO

Authors Mihai Talmaciu

Publication date 17 March 2016

Published in Scientific Studies and Research. Series Mathematics and Informatics (Search for Journal in Brave)

zbMATH Keywords

chordal graphsdually chordal graphshereditary dually chordal graphsrecognition algorithmweak decomposition

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Fast algorithms of hereditary doubly chordal graphs
• Generalizations of triangulated graphs
• Dually Chordal Graphs
• scientific article; zbMATH DE number 1743828
• Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs

Cited in

(8)

• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• A faster diameter problem algorithm for a chordal graph, with a connection to its center problem
• scientific article; zbMATH DE number 1305520 (Why is no real title available?)
• scientific article; zbMATH DE number 1743828 (Why is no real title available?)
• Fast algorithms of hereditary doubly chordal graphs
• Generalizations of triangulated graphs
• Doubling Algorithms with Permuted Lagrangian Graph Bases
• scientific article; zbMATH DE number 1445284 (Why is no real title available?)

This page was built for publication: Fast algorithms of dually chordal graphs

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