Can dense graphs be "sparse"?

Ganian,  Robert; Hliněný,  Petr; Obdržálek,  Jan; Nešetřil,  Jaroslav; Ossona de Mendez, Patrice; Ramadurai,  Reshma

Can dense graphs be "sparse"?

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official publication website can be found on muni.cz.

Authors	GANIAN Robert HLINĚNÝ Petr OBDRŽÁLEK Jan NEŠETŘIL Jaroslav OSSONA DE MENDEZ Patrice RAMADURAI Reshma
Year of publication	2012
Type	Conference abstract
MU Faculty or unit	Faculty of Informatics
Citation
Related projects:	Well-structured combinatorial classes, width parameters, and design of efficient algorithms