Constrained-Path Labellings on Graphs of Bounded Clique-Width
- 28 May 2009
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 47 (2) , 531-567
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Connectivity check in 3-connected planar graphs with obstaclesElectronic Notes in Discrete Mathematics, 2008
- Compact Forbidden-Set Routing2007
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions2007
- The monadic second-order logic of graphs XV: On a conjecture by D. SeeseJournal of Applied Logic, 2006
- Distance labeling in graphsJournal of Algorithms, 2004
- Compact and localized distributed data structuresDistributed Computing, 2003
- Query efficient implementation of graphs of bounded clique-widthDiscrete Applied Mathematics, 2003
- Upper bounds to the clique width of graphsDiscrete Applied Mathematics, 2000
- Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-WidthTheory of Computing Systems, 2000
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996