-
1
-
-
0012488850
-
Quality matching and local improvement for multilevel graph-partitioning
-
R. Diekmann B. Monien, R. Preis. Quality matching and local improvement for multilevel graph-partitioning. Parallel Comput., 26(12):1609-1634, 2000.
-
(2000)
Parallel Comput.
, vol.26
, Issue.12
, pp. 1609-1634
-
-
Diekmann, R.1
Monien, B.2
Preis, R.3
-
2
-
-
0003491368
-
-
S. Bornholdt and H.G. Schuster, editors. Wiley VCH
-
S. Bornholdt and H.G. Schuster, editors. Handbook of Graphs and Networks. Wiley VCH, 2003.
-
(2003)
Handbook of Graphs and Networks
-
-
-
3
-
-
4444260148
-
A unified representation for multi-protein complex data for modeling protein interaction networks
-
R. Meraz S. Holbrook C. Ding, X. He. A unified representation for multi-protein complex data for modeling protein interaction networks. Proteins: Structure, Function, and Bioinformatics, 57:99-108, 2004.
-
(2004)
Proteins: Structure, Function, and Bioinformatics
, vol.57
, pp. 99-108
-
-
Meraz, R.1
Holbrook, S.2
Ding, C.3
He, X.4
-
4
-
-
4444260148
-
A unified representation of multiprotein complex data for modeling interaction networks
-
Richard F. Meraz Stephen R. Holbrook Chris Ding, Xiaofeng He. A unified representation of multiprotein complex data for modeling interaction networks. Proteins: Structure, Function, and Bioinformatics, 57(1):99-108, 2004.
-
(2004)
Proteins: Structure, Function, and Bioinformatics
, vol.57
, Issue.1
, pp. 99-108
-
-
Meraz, R.F.1
Holbrook, S.R.2
Ding, C.3
He, X.4
-
5
-
-
0036580169
-
Protein interactions: Two methods for assessment of the reliability of high throughput observations
-
May
-
Xenarios I Eisenberg D. Deane CM, Salwinski L. Protein interactions: two methods for assessment of the reliability of high throughput observations. Mol Cell Proteomics., 1(5):349-56, May 2002.
-
(2002)
Mol Cell Proteomics
, vol.1
, Issue.5
, pp. 349-356
-
-
Xenarios, I.1
Eisenberg, D.2
Deane, C.M.3
Salwinski, L.4
-
8
-
-
85030568489
-
Data structures for weighted matching and nearest common ancestors with linking
-
H. N. Gabow. Data structures for weighted matching and nearest common ancestors with linking. In SODA, pages 434-443, 1990.
-
(1990)
SODA
, pp. 434-443
-
-
Gabow, H.N.1
-
9
-
-
2942552459
-
An automated method for finding molecular complexes in large protein interaction networks
-
C.W. Hogue G.D. Bader. An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics, 4(1), 2003.
-
(2003)
BMC Bioinformatics
, vol.4
, Issue.1
-
-
Hogue, C.W.1
Bader, G.D.2
-
13
-
-
0003563066
-
A fast and high quality multilevel scheme for partitioning irregular graphs
-
Department of Computer Science, University of Minnesota, Minneapolis, MN
-
G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. Technical Report 95-035, Department of Computer Science, University of Minnesota, Minneapolis, MN, 1998.
-
(1998)
Technical Report 95-035
-
-
Karypis, G.1
Kumar, V.2
-
15
-
-
33746647551
-
Properties of highly clustered networks
-
M. E. J. Newman. Properties of highly clustered networks. Physics Review, 57:99-108, 2003.
-
(2003)
Physics Review
, vol.57
, pp. 99-108
-
-
Newman, M.E.J.1
-
16
-
-
25144469352
-
A multi-level approach for document clustering
-
Jan
-
S. Oliveira and S.C. Seok. A multi-level approach for document clustering. Lecture Notes in Computer Science, 3514:204-211, Jan 2005.
-
(2005)
Lecture Notes in Computer Science
, vol.3514
, pp. 204-211
-
-
Oliveira, S.1
Seok, S.C.2
-
17
-
-
0002703937
-
A theory of alternating paths and blossoms for proving correctness of the (sqrt{E}) general graph maximum matching algorithm
-
V. Vazirani. A theory of alternating paths and blossoms for proving correctness of the (sqrt{E}) general graph maximum matching algorithm. Combinatorica, 14(1):71-109, 1994.
-
(1994)
Combinatorica
, vol.14
, Issue.1
, pp. 71-109
-
-
Vazirani, V.1
|