86 search results - page 3 / 18 » On the Maximum Degree of a Random Planar Graph |
SODA
2010
ACM
14 years 8 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
GC
2007
Springer
13 years 10 months ago
2007
Springer
A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with n vertices and m ...
ESA
2004
Springer
14 years 4 months ago
2004
Springer
We present a randomized algorithm for finding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Sin...
WG
2005
Springer
14 years 4 months ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...
FAW
2009
Springer
14 years 5 months ago
2009
Springer
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...