Pages that link to "Item:Q5851090"
From MaRDI portal
The following pages link to Algorithms for Classes of Graphs with Bounded Expansion (Q5851090):
Displaying 9 items.
- Confronting intractability via parameters (Q465686) (← links)
- On the speed of algebraically defined graph classes (Q2227284) (← links)
- Limitations on Explicit Constructions of Expanding Graphs (Q3323289) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q3452835) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness (Q5140724) (← links)
- Algorithms for #BIS-hard problems on expander graphs (Q5236322) (← links)
- A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs (Q5301387) (← links)
- Algorithms for (0, 1,<i>d</i>)-graphs with<i>d</i>constrains (Q5747711) (← links)
- A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897) (← links)