Pages that link to "Item:Q5387744"

The following pages link to Dynamic Distance Hereditary Graphs Using Split Decomposition (Q5387744):

Displaying 13 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 survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
• Practical and efficient circle graph recognition (Q472484) (← links)
• Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
• Solving problems on graphs of high rank-width (Q1709595) (← links)
• Distance-hereditary comparability graphs (Q1759843) (← links)
• Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way (Q3010409) (← links)
• Solving Problems on Graphs of High Rank-Width (Q3449829) (← links)
• An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs (Q3590946) (← links)
• The axiomatic characterization of the interval function of distance hereditary graphs (Q6126719) (← links)
• Hypergraphs with polynomial representation: introducing \(r\)-splits (Q6599817) (← links)
• Word-representability of graphs with respect to split recomposition (Q6611031) (← links)