86 search results - page 1 / 18 » On the Maximum Degree of a Random Planar Graph |
STOC
2007
ACM
14 years 5 months ago
2007
ACM
CPC
2008
13 years 4 months ago
2008
JGAA
2007
13 years 4 months ago
2007
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...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
JGT
2007
13 years 4 months ago
2007