DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Bounded expansion
Bounded expansion
Layouts of Expander Graphs
Characterising Bounded Expansion by Neighbourhood Complexity
Lecture Beyond Planar Graphs 1 Overview 2 Preliminaries
On Quasi-Planar Graphs: Clique-Width and Logical Description
Characterisations and Examples of Graph Classes with Bounded Expansion Jaroslav Nešetřil A, Patrice Ossona De Mendez B, David R
An Annotated Bibliography on 1-Planarity
Logic, Graphs, and Algorithms
Colouring and Covering Nowhere Dense Graphs∗
A Separator Theorem for String Graphs and Its Applications
Notes on Graph Product Structure Theory
Characterisations and Examples of Graph Classes with Bounded Expansion
Notes on Graph Product Structure Theory
Distributed Domination on Graph Classes of Bounded Expansion
Lacon- and Shrub-Decompositions: a New Characterization of First-Order Transductions of Bounded Expansion Classes
Distributed Domination on Graph Classes of Bounded Expansion Arxiv:1702.02848V2
27 Jun 2018 Recovering Sparse Graphs
Recovering Sparse Graphs
Measuring Sparsity Compilation Date: October 24, 2017
Top View
Sparsity and Dimension
O(N) First-Order Queries on Graph Classes with Bounded Expansion Harry Okun Advised by Professor Steven Lindell We Collect the P
Distributed Dominating Set Approximations Beyond Planar Graphs
Chromatic and Structural Properties of Sparse Graph Classes
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs Arxiv:1501.00721V2 [Cs.CG] 31 May 2016
Graph Minors
On Low Tree-Depth Decompositions Jaroslav Nesetril, Patrice Ossona De Mendez
Planar Graphs Have Bounded Queue-Number∗
Grad and Classes with Bounded Expansion II. Algorithmic Aspects
Clustering Powers of Sparse Graphs
Sublinear Separators, Fragility and Subexponential Expansion
Algorithmic Techniques for Sparse Graphs
Grad and Classes with Bounded Expansion II. Algorithmic Aspects. Jaroslav Nesetril, Patrice Ossona De Mendez
Algorithmic Properties of Sparse Digraphs
Arxiv:2012.02701V3 [Cs.DS] 28 Jun 2021 (Sequential) Approximations Are Possible
Algorithmic Properties of Sparse Digraphs
Algorithmic Properties of Sparse Digraphs
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy