Sciweavers

1542 search results - page 3 / 309
» The metamathematics of random graphs
Sort
View
COMBINATORICS
2002
89views more  COMBINATORICS 2002»
13 years 8 months ago
Generating a Random Sink-free Orientation in Quadratic Time
A sink-free orientation of a finite undirected graph is a choice of orientation
Henry Cohn, Robin Pemantle, James Gary Propp
INFOCOM
2012
IEEE
11 years 11 months ago
Sampling directed graphs with random walks
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
Bruno F. Ribeiro, Pinghui Wang, Fabricio Murai, Do...
COMBINATORICS
2002
136views more  COMBINATORICS 2002»
13 years 8 months ago
Minimum Connected Dominating Sets of Random Cubic Graphs
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
William Duckworth
RSA
2000
149views more  RSA 2000»
13 years 8 months ago
Hamilton cycles in random graphs and directed graphs
Colin Cooper, Alan M. Frieze