Pages that link to "Item:Q1383155"
From MaRDI portal
The following pages link to On interval routing schemes and treewidth (Q1383155):
Displaying 20 items.
- Semi-preemptive routing on trees (Q1003476) (← links)
- A survey on interval routing (Q1575744) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- The complexity of the characterization of networks supporting shortest-path interval routing. (Q1853562) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Searching among intervals and compact routing tables (Q1913700) (← links)
- Minors in graphs of large \(\theta_r\)-girth (Q2400974) (← links)
- On the hardness of minimizing space for all-shortest-path interval routing schemes (Q2465642) (← links)
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- Quickly excluding \(K_{2,r}\) from planar graphs (Q2741369) (← links)
- Characterization results of all shortest paths interval routing schemes (Q2744657) (← links)
- Low Polynomial Exclusion of Planar Graph Patterns (Q2958196) (← links)
- Compact Forbidden-Set Routing (Q3590921) (← links)
- Interval Routing onk-Trees (Q4386452) (← links)
- (Q4736828) (← links)
- (Q4945787) (← links)
- Algorithms, Complexity, and Hans (Q5042448) (← links)
- Properties of uniformly \(3\)-connected graphs (Q6599816) (← links)
- A constant-factor approximation for weighted bond cover (Q6671673) (← links)