scientific article; zbMATH DE number 16297
From MaRDI portal
Publication:3972950
[For the entire collection see Zbl 0719.00011.] The concept of separators is an extremely useful tool for dealing with many families of graphs. For graphs with small separators efficient and systematic methods can be developed for solving extremal and computational problems in `` divide and conquer fashion. Various separator theorems are discussed and references to many other applications in algorithmic design are included.
Recommendations
Cited in
(28)- Equipartitions of graphs
- Graph separators: A parameterized view
- On 3-pushdown graphs with large separators
- Graph separators, with applications
- A near optimal algorithm for edge separators (preliminary version)
- Edge separators for quasi-binary trees
- scientific article; zbMATH DE number 432835 (Why is no real title available?)
- Applications of Luzinian separation principles (non-separable case)
- scientific article; zbMATH DE number 5161470 (Why is no real title available?)
- A Heuristic Algorithm for Small Separators in Arbitrary Graphs
- scientific article; zbMATH DE number 1796976 (Why is no real title available?)
- Ramsey goodness of bounded degree trees
- scientific article; zbMATH DE number 4114676 (Why is no real title available?)
- Isometric universal graphs
- Separator theorems for interval graphs and proper interval graphs
- Sparse Matrix Factorizations for Fast Linear Solvers with Application to Laplacian Systems
- Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem
- Better Algorithms and Bounds for Directed Maximum Leaf Problems
- Sparse universal graphs for planarity
- Packing topological minors half‐integrally
- \(N\)-separators in planar graphs
- New graph decompositions with applications to emulations
- Universality for graphs with bounded density
- Size-Ramsey numbers of structurally sparse graphs
- Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs
- Faithful universal graphs for minor-closed classes
- How to catch marathon cheaters: new approximation algorithms for tracking paths
- Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972950)
