31 search results - page 6 / 7 » Regular induced subgraphs of a random Graph |
IJON
2007
13 years 10 months ago
2007
Many conceptual studies of local cortical networks assume completely random wiring. For spatially extended networks, however, such random graph models are inadequate. The geometry...
SODA
2012
ACM
12 years 23 days ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
STOC
2005
ACM
14 years 10 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
ATAL
2007
Springer
14 years 4 months ago
2007
Springer
Recent studies have shown that various models can explain the emergence of complex networks, such as scale-free and small-world networks. This paper presents a different model to...
CIKM
2008
Springer
14 years 10 days ago
2008
Springer
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...