A completely dynamic algorithm for split graphs

DOI10.1016/J.ENDM.2006.08.060MaRDI QIDQ3439534zbMATH OpenOpenAlexFDO

Authors F. Mancini, Pinar Heggernes

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2006.08.060

zbMATH Keywords

dynamic algorithmgraph algorithmgraph completionsplit graph

Mathematics Subject Classification ID

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

Recommendations

• Dynamically maintaining split graphs
• Fully dynamic algorithms for chordal graphs and split graphs
• Minimal split completions
• Minimal Split Completions of Graphs
• Dynamic Distance Hereditary Graphs Using Split Decomposition

Cited in

(9)

• Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
• Dynamically maintaining split graphs
• scientific article; zbMATH DE number 1617249 (Why is no real title available?)
• Fully dynamically maintaining minimal integral separator for threshold and difference graphs
• Minimal Split Completions of Graphs
• Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
• Fully dynamic algorithms for chordal graphs and split graphs
• Dynamic Distance Hereditary Graphs Using Split Decomposition
• Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs

This page was built for publication: A completely dynamic algorithm for split graphs

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