1542 search results - page 39 / 309 » The metamathematics of random graphs |
COMBINATORICS
2000
14 years 9 months ago
2000
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
ARSCOM
2004
14 years 9 months ago
2004
We first prove that for any fixed k a cubic graph with few short cycles contains a Kk-minor. This is a direct generalisation of a result on girth by Thomassen. We then use this the...
107
click to vote
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...
CSDA
2010
14 years 9 months ago
2010
Abstract: Fusion of information from graph features and content can provide superior inference for an anomaly detection task, compared to the corresponding content-only or graph fe...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In this paper, we study phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a...