Connectivity for random graphs from a weighted bridge-addable class
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable structured class, such as the class of all planar graphs. Here we consider a general 'bridge-addable' class of graphs - if a graph is in the class and u and v are vertices in diffe...
| Autor principal: | |
|---|---|
| Formato: | Journal article |
| Idioma: | English |
| Publicado em: |
2012
|