Pages that link to "Item:Q5270408"
From MaRDI portal
The following pages link to Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408):
Displaying 9 items.
- Approximation in (Poly-) logarithmic space (Q2037114) (← links)
- A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Constant round distributed domination on graph classes with bounded expansion (Q2117740) (← links)
- Approximation in (Poly-) Logarithmic Space (Q5089177) (← links)
- A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. (Q5089241) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (Q5857009) (← links)
- Distributed domination on sparse graph classes (Q6614403) (← links)
