| GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Jaroslav NEŠETŘIL, Patrice OSSONA DE MENDEZ a Reshma RAMADURAI. Can dense graphs be "sparse"? In Third Workshop on Graphs and Matroids; Maastricht, The Netherlands. 2012. |
Další formáty:
BibTeX
LaTeX
RIS
@proceedings{1075320,
author = {Ganian, Robert and Hliněný, Petr and Obdržálek, Jan and Nešetřil, Jaroslav and Ossona de Mendez, Patrice and Ramadurai, Reshma},
booktitle = {Third Workshop on Graphs and Matroids; Maastricht, The Netherlands},
keywords = {shrub-depth; sparsity; MSO model checking},
language = {eng},
title = {Can dense graphs be "sparse"?},
year = {2012}
}
TY - CONF
ID - 1075320
AU - Ganian, Robert - Hliněný, Petr - Obdržálek, Jan - Nešetřil, Jaroslav - Ossona de Mendez, Patrice - Ramadurai, Reshma
PY - 2012
TI - Can dense graphs be "sparse"?
KW - shrub-depth
KW - sparsity
KW - MSO model checking
ER -
GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Jaroslav NEŠETŘIL, Patrice OSSONA DE MENDEZ a Reshma RAMADURAI. Can dense graphs be ''sparse''? In \textit{Third Workshop on Graphs and Matroids; Maastricht, The Netherlands}. 2012.
|
