Sciweavers

86 search results - page 1 / 18
» On the Maximum Degree of a Random Planar Graph
Sort
View
STOC
2007
ACM
110views Algorithms» more  STOC 2007»
14 years 11 months ago
Randomly coloring planar graphs with fewer colors than the maximum degree
Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda
CPC
2008
60views more  CPC 2008»
13 years 10 months ago
On the Maximum Degree of a Random Planar Graph
Colin McDiarmid, Bruce A. Reed
JGAA
2007
142views more  JGAA 2007»
13 years 10 months ago
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
Kerri Morgan, Graham Farr
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
14 years 2 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch