Implicit representation of graphs
SIAM Journal on Discrete Mathematics
An algebraic theory of graph reduction
Journal of the ACM (JACM)
k-NLC graphs and polynomial algorithms
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
NC-Algorithms for Graphs with Small Treewidth
WG '88 Proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
On the Relationship Between Clique-Width and Treewidth
SIAM Journal on Computing
Clique-width minimization is NP-hard
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Query efficient implementation of graphs of bounded clique-width
Discrete Applied Mathematics
Subjective-Cost policy routing
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Approximating rank-width and clique-width quickly
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Efficient First-Order Model-Checking Using Short Labels
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Graph operations characterizing rank-width
Discrete Applied Mathematics
Note: A note on models for graph representations
Theoretical Computer Science
As Good as It Gets: Competitive Fault Tolerance in Network Structures
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
On a disparity between relative cliquewidth and relative NLC-width
Discrete Applied Mathematics
Graph operations characterizing rank-width and balanced graph expressions
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Forbidden-set distance labels for graphs of bounded doubling dimension
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
f-sensitivity distance Oracles and routing schemes
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Fault-tolerant compact routing schemes for general graphs
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The Journal of Supercomputing
Fault-tolerant compact routing schemes for general graphs
Information and Computation
| Hi-index | 0.00 |
We study labelling schemes for X-constrained path problems. Given a graph (V,E) and X ⊆ V, a path is X-constrained if all intermediate vertices avoid X. We study the problem of assigning labels J(x) to vertices so that given {J(x) : x ∈ X} for any X ⊆ V, we can route on the shortest X-constrained path between x, y ∈ X. This problem is motivated by Internet routing, where the presence of routing policies means that shortest-path routing is not appropriate. For graphs of tree width k, we give a routing scheme using routing tables of size O(k2 log2 n). We introduce m-clique width, generalizing clique width, to show that graphs of m-clique width k also have a routing scheme using size O(k2 log2 n) tables.