Separator theorem and algorithms for planar hyperbolic graphs
From MaRDI portal
Cites work
- A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
- A partial k-arboretum of graphs with bounded treewidth
- A Separator Theorem for Planar Graphs
- An Experimental Study of the Treewidth of Real-World Graph Data
- Applications of a Planar Separator Theorem
- Applying clique-decomposition for computing Gromov hyperbolicity
- Approximate tree decompositions of planar graphs in linear time
- Approximation algorithms for NP-complete problems on planar graphs
- Bidimensionality: new connections between FPT algorithms and PTASs
- Cliques in hyperbolic random graphs
- Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
- Computing the Gromov hyperbolicity of a discrete metric space
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
- Excluded grid minors and efficient polynomial-time approximation schemes
- From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. V. Excluding a planar graph
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 3750313 (Why is no real title available?)
- scientific article; zbMATH DE number 3612055 (Why is no real title available?)
- scientific article; zbMATH DE number 1306896 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1385418 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- scientific article; zbMATH DE number 3445275 (Why is no real title available?)
- scientific article; zbMATH DE number 7529154 (Why is no real title available?)
- Hyperbolic intersection graphs and (quasi)-polynomial time
- Hyperbolic Minesweeper is in P
- Hyperbolic random graphs: separators and treewidth
- Into the square: on the complexity of some quadratic-time solvable problems
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Minimum vertex cover in rectangle graphs
- Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs
- On light spanners, low-treewidth embeddings and efficient traversing in minor-free graphs
- On the complexity of k-SAT
- On the hyperbolicity of small-world and tree-like random graphs
- On the tree-width of planar graphs
- Packing and Covering δ-Hyperbolic Spaces by Balls
- Selected works of Oded Schramm. In 2 volumes. Edited by Itai Benjamini and Olle Häggström
- SOFSEM 2005: Theory and Practice of Computer Science
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Solving vertex cover in polynomial time on hyperbolic random graphs
- Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Tree decompositions and social graphs
- Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
- Treewidth, kernels, and algorithms. Essays dedicated to Hans L. Bodlaender on the occasion of his 60th birthday
- Wavelength conversion in optical networks
- When can graph hyperbolicity be computed in linear time?
Cited in
(2)
This page was built for publication: Separator theorem and algorithms for planar hyperbolic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6895831)
