2079 search results - page 41 / 416 » Universality of random graphs |
105
click to vote
INFOCOM
2003
IEEE
15 years 7 months ago
2003
IEEE
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
103
click to vote
DIAGRAMS
2000
Springer
15 years 6 months ago
2000
Springer
The goal of the paper is to explicate some common formal logic underlying various notational systems used in visual modeling. The idea is to treat the notational diversity as the d...
171
Voted
COLOGNETWENTE
2010
15 years 17 days ago
2010
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...
123
click to vote
CAAN
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
137
click to vote
CP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...