Query efficient implementation of graphs of bounded clique-width
From MaRDI portal
Publication:1408820
DOI10.1016/S0166-218X(02)00421-3zbMath1029.68113MaRDI QIDQ1408820
Publication date: 25 September 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (22)
Tree-decompositions with bags of small diameter ⋮ Connectivity check in 3-connected planar graphs with obstacles ⋮ Inductive computations on graphs defined by clique-width expressions ⋮ An adjacency labeling scheme based on a decomposition of trees into caterpillars ⋮ Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs ⋮ Efficient First-Order Model-Checking Using Short Labels ⋮ Compact labelings for efficient first-order model-checking ⋮ Graph Operations Characterizing Rank-Width and Balanced Graph Expressions ⋮ Additive spanners and distance and routing labeling schemes for hyperbolic graphs ⋮ Distance labeling scheme and split decomposition ⋮ Constrained-path labellings on graphs of bounded clique-width ⋮ Compact and localized distributed data structures ⋮ Distance and routing labeling schemes for cube-free median graphs ⋮ Linear delay enumeration and monadic second-order logic ⋮ Unnamed Item ⋮ Compact representation of graphs of small clique-width ⋮ Localized and compact data-structure for comparability graphs ⋮ Graph operations characterizing rank-width ⋮ Optimal centrality computations within bounded clique-width graphs ⋮ Maximum matching in almost linear time on graphs of bounded clique-width ⋮ Distance labeling schemes for \(K_4\)-free bridged graphs ⋮ Distance Labeling for Permutation Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Monadic second-order evaluations on tree-decomposable graphs
- Fundamental properties of infinite trees
- Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms
- A partial k-arboretum of graphs with bounded treewidth
- Monadic second-order logic, graph coverings and unfoldings of transition systems
- Monadic second-order definable graph transductions: a survey
- Shortest paths in digraphs of small treewidth. I: Sequential algorithms
- Dynamic algorithms for graphs of bounded treewidth
- Upper bounds to the clique width of graphs
- Handbook of Graph Grammars and Computing by Graph Transformation
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
This page was built for publication: Query efficient implementation of graphs of bounded clique-width
