Pages that link to "Item:Q3590946"

The following pages link to An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs (Q3590946):

Displaying 8 items.

• Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
• A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
• A fully dynamic algorithm for modular decomposition and recognition of cographs. (Q1427188) (← links)
• A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
• Fully dynamic representations of interval graphs (Q1711837) (← links)
• A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
• A certifying and dynamic algorithm for the recognition of proper circular-arc graphs (Q2232611) (← links)
• Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)