2079 search results - page 23 / 416 » Universality of random graphs |
ARSCOM
2004
14 years 11 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...
119
click to vote
IPPS
1998
IEEE
15 years 4 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 12 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...
83
Voted
CORR
2008
Springer
14 years 12 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...
108
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...