Sciweavers

STOC
2006
ACM

114views Algorithms» more STOC 2006»

Linear time low tree-width partitions and algorithmic consequences

14 years 4 months ago

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

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers