The following pages link to (Q3972950):
Displaying 13 items.
- Edge separators for quasi-binary trees (Q299105) (← links)
- \(N\)-separators in planar graphs (Q661948) (← links)
- New graph decompositions with applications to emulations (Q675853) (← links)
- How to catch marathon cheaters: new approximation algorithms for tracking paths (Q832889) (← links)
- Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem (Q988577) (← links)
- Equipartitions of graphs (Q1182860) (← links)
- Ramsey Goodness of Bounded Degree Trees (Q4635503) (← links)
- Isometric Universal Graphs (Q4992841) (← links)
- Sparse Matrix Factorizations for Fast Linear Solvers with Application to Laplacian Systems (Q5270418) (← links)
- Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem (Q5323046) (← links)
- Better Algorithms and Bounds for Directed Maximum Leaf Problems (Q5458844) (← links)
- Sparse universal graphs for planarity (Q6085077) (← links)
- Packing topological minors half‐integrally (Q6134535) (← links)
