Sciweavers

213 search results - page 6 / 43
» Regular subgraphs of random graphs
Sort
View
JCT
2011
90views more  JCT 2011»
13 years 2 months ago
Small subgraphs in random graphs and the power of multiple choices
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
Torsten Mütze, Reto Spöhel, Henning Thom...
DM
2002
78views more  DM 2002»
13 years 7 months ago
Hamilton cycles in random subgraphs of pseudo-random graphs
Alan M. Frieze, Michael Krivelevich
COMBINATORICA
2006
42views more  COMBINATORICA 2006»
13 years 7 months ago
Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-Cube
Christian Borgs, Jennifer T. Chayes, Remco van der...
TALG
2010
65views more  TALG 2010»
13 years 6 months ago
Maximal biconnected subgraphs of random planar graphs
Konstantinos Panagiotou, Angelika Steger
DAM
2008
134views more  DAM 2008»
13 years 7 months ago
Efficient algorithms for finding critical subgraphs
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
Christian Desrosiers, Philippe Galinier, Alain Her...