Pages that link to "Item:Q1408820"
From MaRDI portal
The following pages link to Query efficient implementation of graphs of bounded clique-width (Q1408820):
Displaying 24 items.
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- Compact representation of graphs of small clique-width (Q724221) (← links)
- Linear delay enumeration and monadic second-order logic (Q967312) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- Graph operations characterizing rank-width (Q1028455) (← links)
- Distance labeling scheme and split decomposition (Q1417571) (← links)
- Constrained-path labellings on graphs of bounded clique-width (Q1959385) (← links)
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
- Distance labeling schemes for \(K_4\)-free bridged graphs (Q2105446) (← links)
- An adjacency labeling scheme based on a decomposition of trees into caterpillars (Q2169946) (← links)
- Distance and routing labeling schemes for cube-free median graphs (Q2223698) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs (Q2428695) (← links)
- Distance Labeling for Permutation Graphs (Q3439382) (← links)
- Efficient First-Order Model-Checking Using Short Labels (Q3507329) (← links)
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions (Q3508555) (← links)
- Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width (Q3569083) (← links)
- Approximating rank-width and clique-width quickly (Q4962768) (← links)
- (Q5092373) (← links)
- Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs (Q5100967) (← links)
- Compact and localized distributed data structures (Q5138487) (← links)
- Connectivity check in 3-connected planar graphs with obstacles (Q5300999) (← links)
- Inductive computations on graphs defined by clique-width expressions (Q5321781) (← links)
