-
1
-
-
0036437231
-
Testing subgraphs in large graphs
-
Alon, N.: Testing subgraphs in large graphs. Random Structures and Algorithms 21, 359-370 (2002)
-
(2002)
Random Structures and Algorithms
, vol.21
, pp. 359-370
-
-
Alon, N.1
-
2
-
-
67149135053
-
Testing triangle-freeness in general graphs
-
Alon, N., Kaufman, T., Krivelevich, M., Ron, D.: Testing triangle-freeness in general graphs. SIAM Journal on Discrete Math. 22(2), 786-819 (2008)
-
(2008)
SIAM Journal on Discrete Math.
, vol.22
, Issue.2
, pp. 786-819
-
-
Alon, N.1
Kaufman, T.2
Krivelevich, M.3
Ron, D.4
-
4
-
-
0022011993
-
Arboricity and subgraph listing algorithms
-
Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM Journal on Computing 14, 210-223 (1985)
-
(1985)
SIAM Journal on Computing
, vol.14
, pp. 210-223
-
-
Chiba, N.1
Nishizeki, T.2
-
6
-
-
84865022114
-
"Tri, Tri again".: Finding Triangles and Small Subgraphs in a Distributed Setting
-
abs/1201.6652
-
Dolev, D., Lenzen, C., Peled, S.: "Tri, Tri again".: Finding Triangles and Small Subgraphs in a Distributed Setting. Computing Research Repository abs/1201.6652 (2012)
-
(2012)
Computing Research Repository
-
-
Dolev, D.1
Lenzen, C.2
Peled, S.3
-
7
-
-
82955197378
-
Counting Stars and Other Small Subgraphs in Sublinear-Time
-
Gonen, M., Ron, D., Shavitt, Y.: Counting Stars and Other Small Subgraphs in Sublinear-Time. SIAM Journal on Discrete Mathematics 25(3), 1365-1411 (2011)
-
(2011)
SIAM Journal on Discrete Mathematics
, vol.25
, Issue.3
, pp. 1365-1411
-
-
Gonen, M.1
Ron, D.2
Shavitt, Y.3
-
8
-
-
0000318572
-
Zur Theorie der diskreten Gebilde, VII. Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel
-
Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg
-
Grötzsch, H.: Zur Theorie der diskreten Gebilde, VII. Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel. In: Math.-Nat. Reihe., vol. 8, pp. 109-120. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg (1958/1959)
-
(1958)
Math.-Nat. Reihe.
, vol.8
, pp. 109-120
-
-
Grötzsch, H.1
-
9
-
-
4444268694
-
Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs
-
Kashtan, N., Itzkovitz, S., Milo, R., Alon, U.: Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics 20(11), 1746-1758 (2004)
-
(2004)
Bioinformatics
, vol.20
, Issue.11
, pp. 1746-1758
-
-
Kashtan, N.1
Itzkovitz, S.2
Milo, R.3
Alon, U.4
-
10
-
-
33847157507
-
Distributed Coloring in Õ(√log n) Bit Rounds
-
Kothapalli, K., Scheideler, C., Onus, M., Schindelhauer, C.: Distributed Coloring in Õ(√log n) Bit Rounds. In: IPDPS (2006)
-
(2006)
IPDPS
-
-
Kothapalli, K.1
Scheideler, C.2
Onus, M.3
Schindelhauer, C.4
-
12
-
-
33744724964
-
Distributed MST for Constant Diameter Graphs
-
Lotker, Z., Patt-Shamir, B., Peleg, D.: Distributed MST for Constant Diameter Graphs. Distributed Computing 18(6) (2006)
-
(2006)
Distributed Computing
, vol.18
, Issue.6
-
-
Lotker, Z.1
Patt-Shamir, B.2
Peleg, D.3
-
13
-
-
0038041103
-
MST Construction in O (loglogn) Communication Rounds
-
Lotker, Z., Pavlov, E., Patt-Shamir, B., Peleg, D.: MST Construction in O (loglogn) Communication Rounds. In: Proc. 15th Symposium on Parallel Algorithms and Architectures (SPAA), pp. 94-100 (2003)
-
(2003)
Proc. 15th Symposium on Parallel Algorithms and Architectures (SPAA)
, pp. 94-100
-
-
Lotker, Z.1
Pavlov, E.2
Patt-Shamir, B.3
Peleg, D.4
-
15
-
-
0037174670
-
Network Motifs: Simple Building Blocks of Complex Networks
-
Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network Motifs: Simple Building Blocks of Complex Networks. Science 298(5594), 824-827 (2002), http://dx.doi.org/10.1126/science.298.5594.824
-
(2002)
Science
, vol.298
, Issue.5594
, pp. 824-827
-
-
Milo, R.1
Shen-Orr, S.2
Itzkovitz, S.3
Kashtan, N.4
Chklovskii, D.5
Alon, U.6
-
16
-
-
79959860533
-
The Round Complexity of Distributed Sorting: Extended Abstract
-
Patt-Shamir, B., Teplitsky, M.: The Round Complexity of Distributed Sorting: Extended Abstract. In: PODC, pp. 249-256 (2011)
-
(2011)
PODC
, pp. 249-256
-
-
Patt-Shamir, B.1
Teplitsky, M.2
-
18
-
-
84868241109
-
Distributed Verification and Hardness of Distributed Approximation
-
Sarma, A.D., Holzer, S., Kor, L., Korman, A., Nanongkai, D., Pandurangan, G., Peleg, D., Wattenhofer, R.: Distributed Verification and Hardness of Distributed Approximation. In: 43rd Symposium on Theory of Computing, STOC (2011)
-
43rd Symposium on Theory of Computing, STOC (2011)
-
-
Sarma, A.D.1
Holzer, S.2
Kor, L.3
Korman, A.4
Nanongkai, D.5
Pandurangan, G.6
Peleg, D.7
Wattenhofer, R.8
|