Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,147,104 papers from all fields of science
Search
Sign In
Create Free Account
Bounded expansion
In graph theory, a family of graphs is said to have bounded expansion if all of its shallow minors are sparse graphs. Many natural families of sparse…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
22 relations
1-planar graph
Algorithm
Book embedding
Clique problem
Expand
Broader (1)
Graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices
Kazuhiro Kurita
,
Kunihiro Wasa
,
Hiroki Arimura
,
T. Uno
arXiv.org
2019
Corpus ID: 195345580
In this paper, we address the independent set enumeration problem. Although many efficient enumeration algorithms for maximal…
Expand
Review
2018
Review
2018
A Generalization of the {\L}o\'s-Tarski Preservation Theorem - Dissertation Summary
Abhisekh Sankaran
,
Supratik Chakraborty
,
B. Adsul
2018
Corpus ID: 253094327
This article gives a summary of the author's Ph.D. dissertation (arXiv:1609.06297). In addition to an overview of notions and…
Expand
2018
2018
Lower and Upper Bound for Computing the Size of All Second Neighbourhoods
G. Gutin
,
G. B. Mertzios
,
F. Reidl
arXiv.org
2018
Corpus ID: 19196535
We consider the problem of computing the size of each $r$-neighbourhood for every vertex of a graph. Specifically, we ask whether…
Expand
2018
2018
Algorithmic Meta-Theorems for Monotone Submodular Maximization
Masakazu Ishihata
,
Takanori Maehara
,
Tomas Rigaux
arXiv.org
2018
Corpus ID: 49667070
We consider a monotone submodular maximization problem whose constraint is described by a logic formula on a graph. Formally, we…
Expand
2018
2018
Experimental evaluation of kernelization algorithms to Dominating Set
Wojciech Nadara
arXiv.org
2018
Corpus ID: 53742564
The theoretical notions of graph classes with bounded expansion and that are nowhere dense are meant to capture structural…
Expand
2017
2017
Deobfuscating sparse graphs
Jakub Gajarský
,
D. Král
arXiv.org
2017
Corpus ID: 125757849
We construct a fixed parameter algorithm parameterized by d and k that takes as an input a graph G' obtained from a d-degenerate…
Expand
2015
2015
C C ] 2 7 N ov 2 01 5 Parameterized Extension Complexity of Independent Set
Jakub Gajarský
,
Petr Hliněný
,
Hans Raj Tiwary
2015
Corpus ID: 11532355
Let G be a graph on n vertices and STABk(G) be the convex hull of characteristic vectors of its independent sets of size at most…
Expand
2013
2013
A better kernel for treewidth-t modulator
Marek Cygan
,
Lukasz Kowalik
,
+13 authors
Iyad A. Kanj
2013
Corpus ID: 16290193
Treedepth-d modulator as a parameter Somnath Sikdar The recent kernelization algorithms in very general sparse graph classes such…
Expand
2010
2010
Probabilistic methods and coloring problems in graphs
G. Llobet
2010
Corpus ID: 118664540
Aquest projecte esta dedicat a estudiar el k-essim nombre cromatic generalitzat que sorgeix de les descomposicions Low Tree…
Expand
1992
1992
Bounded Expansion Codes for Error Control
A. Khayrallah
Coding And Quantization
1992
Corpus ID: 42764483