7 search results - page 1 / 2 » Efficient and exact sampling of simple graphs with given arb... |
86
Voted
CORR
2010
Springer
15 years 10 days ago
2010
Springer
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications rangi...
103
click to vote
CORR
2010
Springer
15 years 10 days ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
DM
2008
15 years 9 days ago
2008
A nonincreasing sequence of nonnegative integers = (d1, d2, ..., dn) is graphic if there is a (simple) graph G of order n having degree sequence . In this case, G is said to reali...
115
Voted
COMGEO
2010
ACM
15 years 10 days ago
2010
ACM
: We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f Q[x,y,z] of arbitrary total degree N. Additionally, our analy...
177
Voted
SIGMOD
2008
ACM
16 years 12 days ago
2008
ACM
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...