Maintaining graph properties of weakly chordal graphs

MaRDI QIDQ2908286zbMATH OpenFDO

Authors Le Thi Hoai An, Mohamed-Amine Boutiche, H. Ait Haddadène

Publication date 4 September 2012

Published in Applied Mathematical Sciences (Ruse) (Search for Journal in Brave)

Full work available at URL http://www.m-hikari.com/ams/ams-2012/ams-13-16-2012/index.html

zbMATH Keywords

dynamic algorithmtree decompositiontree-lengthtree-widthweakly chordal

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 1305520
• Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time
• Fully dynamic algorithms for chordal graphs and split graphs
• Maintaining chordal graphs dynamically: improved upper and lower bounds
• Algorithms and Computation

Cited in

(2)

• The minimum vulnerability problem on graphs
• A separator-based method for generating weakly chordal graphs

This page was built for publication: Maintaining graph properties of weakly chordal graphs

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