Sciweavers

ISMM
2009
Springer
13 years 11 months ago
Some Morphological Operators in Graph Spaces
We study some basic morphological operators acting on the lattice of all subgraphs of a (non-weighted) graph G. To this end, we consider two dual adjunctions between the edge set a...
Jean Cousty, Laurent Najman, Jean Serra
STOC
2006
ACM
114views Algorithms» more  STOC 2006»
14 years 4 months 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