Compact Forbidden-Set Routing

DOI10.1007/978-3-540-70918-3_4zbMath1186.68331OpenAlexW1487962539MaRDI QIDQ3590921

Andrew Twigg, Bruno Courcelle

Publication date: 3 September 2007

Published in: STACS 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_4

zbMATH Keywords

compact routinglabelling schemes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (16)

Connectivity check in 3-connected planar graphs with obstacles ⋮ Inductive computations on graphs defined by clique-width expressions ⋮ Efficient Oracles and Routing Schemes for Replacement Paths ⋮ Compact routing messages in self-healing trees ⋮ On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract) ⋮ Efficient First-Order Model-Checking Using Short Labels ⋮ Graph Operations Characterizing Rank-Width and Balanced Graph Expressions ⋮ Deterministic Fault-Tolerant Connectivity Labeling Scheme ⋮ Constrained-path labellings on graphs of bounded clique-width ⋮ Fault-Tolerant Compact Routing Schemes for General Graphs ⋮ \(f\)-sensitivity distance oracles and routing schemes ⋮ On a disparity between relative cliquewidth and relative NLC-width ⋮ On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth ⋮ Fault-tolerant distance labeling for planar graphs ⋮ A note on models for graph representations ⋮ Graph operations characterizing rank-width

This page was built for publication: Compact Forbidden-Set Routing