Sciweavers

5 search results - page 1 / 1
» Growth constants of minor-closed classes of graphs
Sort
View
JCT
2010
56views more  JCT 2010»
13 years 5 months ago
Growth constants of minor-closed classes of graphs
Olivier Bernardi, Marc Noy, Dominic Welsh
WG
2007
Springer
14 years 1 months ago
Obtaining a Planar Graph by Vertex Deletion
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...
Dániel Marx, Ildikó Schlotter
STOC
2006
ACM
114views Algorithms» more  STOC 2006»
14 years 7 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
EJC
2008
13 years 7 months ago
Grad and classes with bounded expansion II. Algorithmic aspects
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
Jaroslav Nesetril, Patrice Ossona de Mendez
IPPS
1999
IEEE
13 years 11 months ago
Average-Case Analysis of Isospeed Scalability of Parallel Computations on Multiprocessors
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
Keqin Li, Xian-He Sun