The following pages link to Compact Forbidden-Set Routing (Q3590921):
Displaying 15 items.
- \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
- On a disparity between relative cliquewidth and relative NLC-width (Q972344) (← links)
- On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth (Q987381) (← links)
- A note on models for graph representations (Q1008739) (← links)
- Graph operations characterizing rank-width (Q1028455) (← links)
- Compact routing messages in self-healing trees (Q1686108) (← links)
- Constrained-path labellings on graphs of bounded clique-width (Q1959385) (← links)
- Fault-Tolerant Compact Routing Schemes for General Graphs (Q3012912) (← links)
- Efficient Oracles and Routing Schemes for Replacement Paths (Q3304107) (← links)
- On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract) (Q3503637) (← links)
- Efficient First-Order Model-Checking Using Short Labels (Q3507329) (← links)
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions (Q3508555) (← links)
- Connectivity check in 3-connected planar graphs with obstacles (Q5300999) (← links)
- Inductive computations on graphs defined by clique-width expressions (Q5321781) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5918639) (← links)
