R. Feldmann, B. Monien, P. Mysliwietz, and S. Tschke. A Better Upper Bound on the Bisection Width of de Bruijn Networks Tech. Report University of Paderborn. short version in Proc. of STACS'97, Springer LNCS 1200:511-522, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Solving Graph Bisection Problems With Semidefinite Programming - Karisch, Rendl, CLAUSEN (1997) (15 citations) (Correct)
....5.2.2 was already used in [25, 26] and can be obtained from http: www.imm.dk sk eqp.d. The second set of graphs considered in Subsection 5.2.3 stems from Brunetta, Conforti and Rinaldi [5] and is available at ftp: ftp.math.unipd.it pub Misc equicut. Subsection 5.2. 4 contains graphs due to [13, 24, 35] which come from real world applications. The tables in the following sections read as follows: graph specifies the name of the instance, n is the number of vertices, and dens gives the density in percent. A column contains the optimal cut when labeled opt and a feasible solution when ....
....class of problems are graphs representing de Bruijn networks of dimensions n 2 f32; 64; 128g. These networks are prominent interconnections networks for parallel computers. For references into this direction and results regarding the bisection of de Bruijn networks, we refer to Feldmann et al. [13]. The graph representing a de Bruijn network has n = 2 k vertices and is 2k regular, where k is the basis of the network. The unweighted graphs are quite sparse and have therefore minimum cuts of low costs. The next group of instances was introduced by Johnson, Mehrotra and Nemhauser [24] and ....
R. FELDMANN, B. MONIEN, P. MYSLIWIETZ, and S. TSCH OKE. A better upper bound on the bisection width of the de Bruijn networks. In STACS'97 Proceedings, volume 1200, pages 511--522. LNCS, 1995.
Solving Graph Bisection Problems With Semidefinite Programming - Karisch, Rendl, Clausen (1997) (15 citations) (Correct)
....was already used in [25, 26] and can be obtained from http: www.diku.dk karisch eqp.d. The second set of graphs considered in Subsection 5.2.3 stems from Brunetta, Conforti and Rinaldi [5] and is available at ftp: ftp.math.unipd.it pub Misc equicut. Subsection 5.2. 4 contains graphs due to [13, 24, 34] which come from real world applications. The tables in the following sections read as follows: graph specifies the name of the instance, n is the number of vertices, and dens gives the density in percent. SOLVING GRAPH BISECTION PROBLEMS WITH SEMIDEFINITE PROGRAMMING 15 A column contains ....
....class of problems are graphs representing de Bruijn networks of dimensions n 2 f32; 64; 128g. These networks are prominent interconnections networks for parallel computers. For references into this direction and results regarding the bisection of de Bruijn networks, we refer to Feldmann et al. [13]. The graph representing a de Bruijn network has n = 2 k vertices and is 2k regular, where k is the basis of the network. The unweighted graphs are quite sparse and have therefore minimum cuts of low costs. The next group of instances was introduced by Johnson, Mehrotra and Nemhauser [24] and ....
R. FELDMANN, B. MONIEN, P. MYSLIWIETZ, and S. TSCH OKE. A better upper bound on the bisection width of the de Bruijn networks. Technical report, Department of Mathematics and Computer Science, University of Paderborn, Paderborn, Germany, 1996.
Symmetry Breaking - Torsten Fahle Stefan (2001) (14 citations) (Correct)
No context found.
R. Feldmann, B. Monien, P. Mysliwietz, and S. Tschke. A Better Upper Bound on the Bisection Width of de Bruijn Networks Tech. Report University of Paderborn. short version in Proc. of STACS'97, Springer LNCS 1200:511-522, 1997.
Graph-Theoretic Analysis of Structured Peer-to-Peer.. - Loguinov, Kumar, Rai, .. (2003) (22 citations) (Correct)
No context found.
R. Feldmann, B. Monien, P. Mysliwietz, and S. Tschoke, "A Better Upper Bound on the Bisection Width of de Bruijn Networks," Symposium on Theoretical Aspects of Computer Science (STACS), 1997.
Graph-Theoretic Analysis of Structured Peer-to-Peer.. - Loguinov, Kumar, Rai, .. (2003) (22 citations) (Correct)
No context found.
R. Feldmann, B. Monien, P. Mysliwietz, and S. Tschoke, "A Better Upper Bound on the Bisection Width of de Bruijn Networks," Symposium on Theoretical Aspects of Computer Science (STACS), 1997.
Symmetry Breaking - Fahle, Schamberger, Sellmann (2001) (14 citations) (Correct)
No context found.
R. Feldmann, B. Monien, P. Mysliwietz, and S. Tschke. A Better Upper Bound on the Bisection Width of de Bruijn Networks. Tech. Report University of Paderborn. short version: Proc. of STACS'97, Springer LNCS 1200:511-522, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC