The following pages link to (Q5090497):
Displaying 6 items.
- Sparsity. Graphs, structures, and algorithms (Q419416) (← links)
- Fine-grained complexity for sparse graphs (Q5230293) (← links)
- Structural Properties of Sparse Graphs (Q5301017) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897572) (← links)
- A Lower Bound on Cycle-Finding in Sparse Digraphs (Q6058259) (← links)
- Hardness of the generalized coloring numbers (Q6614401) (← links)