Sciweavers

4 search results - page 1 / 1
» Grad and classes with bounded expansion III. Restricted grap...
Sort
View
107
Voted
EJC
2008
15 years 10 days ago
Grad and classes with bounded expansion III. Restricted graph homomorphism dualities
We study restricted homomorphism dualities in the context of classes with bounded expansion. This presents a generalization of restricted dualities obtained earlier for bounded deg...
Jaroslav Nesetril, Patrice Ossona de Mendez
92
Voted
JSYML
2010
120views more  JSYML 2010»
14 years 7 months ago
First order properties on nowhere dense structures
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
Jaroslav Nesetril, Patrice Ossona de Mendez
STOC
2006
ACM
114views Algorithms» more  STOC 2006»
16 years 17 days ago
Linear time low tree-width partitions and algorithmic consequences
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
Jaroslav Nesetril, Patrice Ossona de Mendez
107
Voted
MFCS
2007
Springer
15 years 6 months ago
NP by Means of Lifts and Shadows
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
Gábor Kun, Jaroslav Nesetril