Result 1 to 20 of 1322 total
The $h$-index of a graph and its application to dynamic subgraph statistics. (English)
J. Graph Algorithms Appl. 16, No. 2, 543-567 (2012).
1
Bootstrap percolation on the random graph $G_{n,p}$. (English)
Ann. Appl. Probab. 22, No. 5, 1989-2047 (2012).
2
Stochastic stability of continuous time consensus protocols. (English)
SIAM J. Control Optim. 50, No. 4, 1859-1885 (2012).
3
A weak zero-one law for sequences of random distance graphs. (English)
Sb. Math. 203, No. 7, 1012-1044 (2012); translation from Mat. Sb. 203, No. 7, 95-128 (2012).
4
Joint probability generating function for degrees of active/passive random intersection graphs. (English)
Front. Math. China 7, No. 1, 117-124 (2012).
5
Indicated coloring of graphs. (English)
Discrete Math. 312, No. 23, 3467-3472 (2012).
6
Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem. (English)
Comput. Oper. Res. 39, No. 11, 2763-2775 (2012).
7
Stochastic model of interaction between botnets and distributed computer defense systems. (English)
Kotenko, Igor (ed.) et al., Computer network security. 6th international conference on mathematical methods, models and architectures for computer network security, MMM-ACNS 2012, St. Petersburg, Russia, October 17‒19, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-33703-1/pbk). Lecture Notes in Computer Science 7531, 218-225 (2012).
8
Enhancing the spreading of quantum walks on star graphs by additional bonds. (English)
Quantum Inf. Process. 11, No. 5, 1273-1286 (2012).
9
An investigation of new graph invariants related to the domination number of random proximity catch digraphs. (English)
Methodol. Comput. Appl. Probab. 14, No. 2, 299-334 (2012).
10
Maximum matchings in random bipartite graphs and the space utilization of Cuckoo hash tables. (English)
Random Struct. Algorithms 41, No. 3, 334-364 (2012).
11
Dirac’s theorem for random graphs. (English)
Random Struct. Algorithms 41, No. 3, 293-305 (2012).
12
Cops and robbers on geometric graphs. (English)
Comb. Probab. Comput. 21, No. 6, 816-834 (2012).
13
The diameter of a random subgraph of the hypercube. (English)
Random Struct. Algorithms 41, No. 2, 282-291 (2012).
14
SIR epidemics on random graphs with a fixed degree sequence. (English)
Random Struct. Algorithms 41, No. 2, 179-214 (2012).
15
Extremal subgraphs of random graphs. (English)
Random Struct. Algorithms 41, No. 2, 147-178 (2012).
16
Fixation probabilities on complete star and bipartite digraphs. (English)
Discrete Dyn. Nat. Soc. 2012, Article ID 940465, 21 p. (2012).
17
Distance edge-colourings and matchings. (English)
Discrete Appl. Math. 160, No. 16-17, 2435-2439 (2012).
18
Empirical distributions of Laplacian matrices of large dilute random graphs. (English)
Random Matrices Theory Appl. 1, No. 3, 1250004,20p. (2012).
19
Low eigenvalues of Laplacian matrices of large random graphs. (English)
Probab. Theory Relat. Fields 153, No. 3-4, 671-690 (2012).
20
Result 1 to 20 of 1322 total
Start
Contact
Print
General Help
