Pages that link to "Item:Q1417571"

The following pages link to Distance labeling scheme and split decomposition (Q1417571):

Displaying 14 items.

• Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
• Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
• Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
• Localized and compact data-structure for comparability graphs (Q1025540) (← links)
• Solving problems on graphs of high rank-width (Q1709595) (← links)
• Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
• Distance labeling schemes for \(K_4\)-free bridged graphs (Q2105446) (← links)
• Distance and routing labeling schemes for cube-free median graphs (Q2223698) (← links)
• Additive spanners and distance and routing labeling schemes for hyperbolic graphs (Q2428695) (← links)
• Distance Labeling for Permutation Graphs (Q3439382) (← links)
• Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
• (Q5092373) (← links)
• Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs (Q5100967) (← links)
• Inductive computations on graphs defined by clique-width expressions (Q5321781) (← links)