592 search results - page 51 / 119 » Crossing numbers of random graphs |
SODA
2000
ACM
13 years 9 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
SPAA
2000
ACM
14 years 10 days ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
SLS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
ISCIS
2005
Springer
14 years 1 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...