Search results for "Bisection"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
104	Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich	New Spectral Lower Bounds on the Bisection Width of Graphs.	WG	2000	DBLP DOI BibTeX RDF
93	Piotr Berman, Marek Karpinski	Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION.	ICALP	2002	DBLP DOI BibTeX RDF
86	Jacob G. Martin	Spectral techniques for graph bisection in genetic algorithms.	GECCO	2006	DBLP DOI BibTeX RDF	genetic engineering, reduced rank approximation, spectral bisection, genetic algorithm, singular value decomposition, graph partitioning, graph bisection
79	Bobby Bodenheimer, Jingjing Meng, Haojie Wu, Gayathri Narasimham, Björn Rump, Timothy P. McNamara, Thomas H. Carr, John J. Rieser	Distance estimation in virtual and real environments using bisection.	APGV	2007	DBLP DOI BibTeX RDF	distance bisection, virtual reality (VR), distance perception, fractionation
79	Burkhard Monien, Robert Preis	Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.	MFCS	2001	DBLP DOI BibTeX RDF	local improvement, graph partitioning, regular graphs, bisection width
76	Torsten Hoefler, Timo Schneider, Andrew Lumsdaine	Multistage switches are not crossbars: Effects of static routing in high-performance networks.	CLUSTER	2008	DBLP DOI BibTeX RDF
72	Burkhard Monien, Stefan Schamberger	Graph Partitioning with the Party Library: Helpful-Sets in Practice.	SBAC-PAD	2004	DBLP DOI BibTeX RDF	Heuristic Graph Partitioning, Helpful-Sets, Recursive bisection
71	Claudio Gutierrez 0001, Flavio Gutierrez, Maria-Cecilia Rivara	A Geometric Approach to the Bisection Method.	LATIN	2004	DBLP DOI BibTeX RDF
71	Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel	Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs.	STACS	2001	DBLP DOI BibTeX RDF
61	Lali Barrière, Josep Fàbrega	Edge-Bisection of Chordal Rings.	MFCS	2000	DBLP DOI BibTeX RDF
61	Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov	Can recursive bisection alone produce routable placements?	DAC	2000	DBLP DOI BibTeX RDF
61	Ralf Klasing	The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width.	MFCS	1994	DBLP DOI BibTeX RDF
57	Bernd Hamann, Benjamin W. Jordan, David F. Wiley	On a Construction of a Hierarchy of Best Linear Spline Approximations Using Repeated Bisection.	IEEE Trans. Vis. Comput. Graph.	1999	DBLP DOI BibTeX RDF	linear spline, visualization, Approximation, triangulation, spline, unstructured grid, hierarchical representation, scattered data, bisection, multiresolution method, best approximation, grid generation
54	Betsy Williams, Derek Johnson, Lucy R. Shores, Gayathri Narasimham	Distance perception in virtual environments.	APGV	2008	DBLP DOI BibTeX RDF
54	Ted Carson, Russell Impagliazzo	Hill-climbing finds random planted bisections.	SODA	2001	DBLP BibTeX RDF
54	Graham Wood	Bisection Global Optimization Methods.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Lipschitz continuity, Multidimensional bisection, Epigraph, Linear convergence, System, Reduction, Tiling, Bisection, Simplex, Elimination, Bracket
54	Uriel Feige, Robert Krauthgamer	A polylogarithmic approximation of the minimum bisection.	FOCS	2000	DBLP DOI BibTeX RDF	polylogarithmic approximation, minimum bisection, vertex partitioning, bisection cost, computational complexity, complexity, computational geometry, graph theory, graph, edges, vertices, approximation ratio
54	Mark Jerrum, Gregory B. Sorkin	Simulated Annealing for Graph Bisection	FOCS	1993	DBLP DOI BibTeX RDF	unique smallest bisection, simulated annealing, Metropolis algorithm, graph bisection
50	Charles-Edmond Bichot	Metaheuristics for graph bisection.	GECCO	2009	DBLP DOI BibTeX RDF	metaheuristics, graph partitioning, iterated local search
50	Ameya R. Agnihotri, Satoshi Ono, Chen Li 0004, Mehmet Can Yildiz, Ateen Khatkhate, Cheng-Kok Koh, Patrick H. Madden	Mixed block placement via fractional cut recursive bisection.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2005	DBLP DOI BibTeX RDF
50	Josep Díaz, Maria J. Serna, Nicholas C. Wormald	Computation of the Bisection Width for Random d-Regular Graphs.	LATIN	2004	DBLP DOI BibTeX RDF
50	Jonas Holmerin, Subhash Khot	A Strong Inapproximability Gap for a Generalization of Minimum Bisection.	CCC	2003	DBLP DOI BibTeX RDF
50	Eran Halperin, Uri Zwick	A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems.	IPCO	2001	DBLP DOI BibTeX RDF
46	Jonas Holmerin, Subhash Khot	A new PCP outer verifier with applications to homogeneous linear equations and max-bisection.	STOC	2004	DBLP DOI BibTeX RDF	max-bisection, hardness of approximation, linear equations, PCPs
46	Pranava K. Jha	A Counterexample to Tang and Padubidri's Claim about the Bisection Width of a Diagonal Mesh.	IEEE Trans. Computers	2003	DBLP DOI BibTeX RDF	Diagonal mesh, bisection width
46	Linda Kaufman	An observation on bisection software for the symmetric tridiagonal eigenvalue problem.	ACM Trans. Math. Softw.	2000	DBLP DOI BibTeX RDF	eigenvalues, bisection
43	Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi	Bisecting a Four-Connected Graph with Three Resource Sets.	ISAAC	2005	DBLP DOI BibTeX RDF
43	Meinolf Sellmann, Norbert Sensen, Larissa Timajev	Multicommodity Flow Approximation Used for Exact Graph Partitioning.	ESA	2003	DBLP DOI BibTeX RDF
43	George Karypis, Rajat Aggarwal, Vipin Kumar 0001, Shashi Shekhar	Multilevel hypergraph partitioning: applications in VLSI domain.	IEEE Trans. Very Large Scale Integr. Syst.	1999	DBLP DOI BibTeX RDF
43	Youssef Saab, Vasant B. Rao	Fast effective heuristics for the graph bisectioning problem.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1990	DBLP DOI BibTeX RDF
40	Patrick Geoffray, Torsten Hoefler	Adaptive Routing Strategies for Modern High Performance Networks.	Hot Interconnects	2008	DBLP DOI BibTeX RDF	bisection bandwidth, adaptive routing, Clos networks, head-of-line blocking
40	Honghui Hu, Naijie Gu, Jing Cao	A Note on Recursive Cube of Rings Network.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	Recursive Cube of Rings (RCR), disconnected graph, network diameter, bisection width
40	Samy Ait-Aoudia	Numerical Solving of Geometric Constraints.	IV	2002	DBLP DOI BibTeX RDF	bisection method, constraints, geometric modeling
39	Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin 0001	A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem.	IPCO	2008	DBLP DOI BibTeX RDF	Branch and cut algorithms, semidefinite programs, polyhedral combinatorics, cutting plane algorithms
39	Jingjing Meng, John J. Rieser, Bobby Bodenheimer	Distance estimation in virtual environments using bisection.	APGV	2006	DBLP DOI BibTeX RDF
39	Ameya R. Agnihotri, Mehmet Can Yildiz, Ateen Khatkhate, Ajita Mathur, Satoshi Ono, Patrick H. Madden	Fractional Cut: Improved Recursive Bisection Placement.	ICCAD	2003	DBLP DOI BibTeX RDF
39	Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald	Bisection of Random Cubic Graphs.	RANDOM	2002	DBLP DOI BibTeX RDF
39	José D. P. Rolim, Ondrej Sýkora, Imrich Vrto	Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes.	WG	1995	DBLP DOI BibTeX RDF
39	Manfred Kunde	Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound.	ESA	1993	DBLP DOI BibTeX RDF
39	Juraj Hromkovic, Burkhard Monien	The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems).	MFCS	1991	DBLP DOI BibTeX RDF
39	Thang Nguyen Bui, C. Heigham, Curt Jones, Frank Thomson Leighton	Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms.	DAC	1989	DBLP DOI BibTeX RDF
39	Saul Gorn	Bisection Routine (Algorithm 4).	Commun. ACM	1960	DBLP DOI BibTeX RDF
35	Youssef Saab	A Fast and Robust Network Bisection Algorithm.	IEEE Trans. Computers	1995	DBLP DOI BibTeX RDF	VLSI networks, approximation algorithms, hypergraphs, Bisection, iterative improvement
35	Manfred Kunde	Concentrated Regular Data Streams on Grids: Sorting and Routing Near to the Bisection Bound	FOCS	1991	DBLP DOI BibTeX RDF	offline routing, concentrated regular data streams, bisection bound, 1-1 sorting, h-h sorting, routing, sorting, deterministic algorithms, permutation routing
34	Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch	The Minimum Bisection in the Planted Bisection Model.	Theory Comput.	2017	DBLP DOI BibTeX RDF
34	Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch	The minimum bisection in the planted bisection model.	CoRR	2015	DBLP BibTeX RDF
34	Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch	The Minimum Bisection in the Planted Bisection Model.	APPROX-RANDOM	2015	DBLP DOI BibTeX RDF
33	Carl Olsson, Anders P. Eriksson, Fredrik Kahl	Efficient Optimization for L-problems using Pseudoconvexity.	ICCV	2007	DBLP DOI BibTeX RDF
33	Amin Coja-Oghlan	A spectral heuristic for bisecting random graphs.	SODA	2005	DBLP BibTeX RDF
33	Tae-Young Choe, Chan-Ik Park	A k-way Graph Partitioning Algorithm Based on Clustering by Eigenvector.	International Conference on Computational Science	2004	DBLP DOI BibTeX RDF
33	Bernard Mans, Igor E. Shparlinski	Bisecting and Gossiping in Circulant Graphs.	LATIN	2004	DBLP DOI BibTeX RDF
33	André DeHon	Rent's rule based switching requirements.	SLIP	2001	DBLP DOI BibTeX RDF	switching requirements, hierarchical networks, Rent's rule
33	Chao-Wei Ou, Sanjay Ranka	Parallel Incremental Graph Partitioning.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	parallel, Linear-programming, refinement, mapping, remapping
33	George Karypis, Rajat Aggarwal, Vipin Kumar 0001, Shashi Shekhar	Multilevel Hypergraph Partitioning: Application in VLSI Domain.	DAC	1997	DBLP DOI BibTeX RDF
33	Burkhard Monien, Ralf Diekmann, Reinhard Lüling	Communication Throughput of Interconnection Networks.	MFCS	1994	DBLP DOI BibTeX RDF
33	Chao-Wei Ou, Sanjay Ranka	Parallel incremental graph partitioning using linear programming.	SC	1994	DBLP DOI BibTeX RDF
29	Kurt Mehlhorn, Michael Sagraloff	Isolating real roots of real polynomials.	ISSAC	2009	DBLP DOI BibTeX RDF	bisection algorithm, bitstream coefficient, descartes' rule of sign, real polynomial, root isolation
29	Kenneth Weiss 0001, Leila De Floriani	Sparse terrain pyramids.	GIS	2008	DBLP DOI BibTeX RDF	diamond hierarchies, longest edge bisection, multiresolution terrain models, nested triangle meshes
29	Francisco Damasceno Freitas, João Yoshiyuki Ishihara, Geovany de Araújo Borges	An Efficient Technique for Computing a Sub-optimal Disturbance Attenuation Hinfinity Control Problem Feedback Solution.	CSE	2008	DBLP DOI BibTeX RDF	Kleiman method, Smith method, optimal control, bisection, Riccati equation, Lyapunov equation
29	Ting Zhang, Bican Xia	A New Method for Real Root Isolation of Univariate Polynomials.	Math. Comput. Sci.	2007	DBLP DOI BibTeX RDF	Real root isolation, interval Newton operator, bisection method, Maple, interval arithmetic
29	Behrooz Parhami, Mikhail A. Rakov	Perfect Difference Networks and Related Interconnection Structures for Parallel and Distributed Systems.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	hyperstar, low-diameter network, two-hop connectivity, interconnection network, Bipartite graph, diameter, degree, chordal ring, regular network, bisection width
29	Peter Lindstrom 0001, Valerio Pascucci	Terrain Simplification Simplified: A General Framework for View-Dependent Out-of-Core Visualization.	IEEE Trans. Vis. Comput. Graph.	2002	DBLP DOI BibTeX RDF	continuous levels of detail, edge bisection, geomorphing, external memory paging, out-of-core algorithms, data layouts, Terrain visualization, surface simplification, error metrics, view-dependent refinement
29	Hüuseyin Kutluca, Tahsin M. Kurç, Cevdet Aykanat	Image-Space Decomposition Algorithms for Sort-First Parallel Volume Rendering of Unstructured Grids.	J. Supercomput.	2000	DBLP DOI BibTeX RDF	sort-first parallelism, image-space decomposition, chains-on-chains partitioning, jagged decomposition, rectilinear decomposition, orthogonal recursive bisection, Hilbert space-filling curve, graph partitioning, unstructured grids, direct volume rendering
29	Chien-Ping Chang, Ting-Yi Sung, Lih-Hsing Hsu	Edge Congestion and Topological Properties of Crossed Cubes.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	edge congestion, hypercubes, embedding, shortest path routing, wide diameter, fault diameter, Crossed cubes, bisection width
29	Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya	Geometric bipartitioning problem and its applications to VLSI.	VLSI Design	1996	DBLP DOI BibTeX RDF	geometric bipartitioning problem, layout design, rectilinear modules, staircase, monotone increasing, classical graph bisection problem, weighted permutation graph, integer edge weights, designated nodes, absolute value, edge weights, routing, computational complexity, VLSI, VLSI, graph theory, NP-complete, branch-and-bound, floorplan, heuristic algorithm, search problems, geometry, network routing, circuit layout CAD, hierarchical decomposition
29	José M. Badía, Antonio M. Vidal	Efficient solution of the eigenproblem of banded symmetric Toeplitz matrices on multicomputers.	PDP	1995	DBLP DOI BibTeX RDF	eigenproblem, banded symmetric Toeplitz matrices, bisection method, eigenstructure, network of transputers, farming technique, parallel algorithms, parallel algorithms, multicomputers, distributed memory multiprocessor, mathematics computing, eigenvalues and eigenfunctions, Toeplitz matrices
29	Yu-Chee Tseng, Sandeep K. S. Gupta, Dhabaleswar K. Panda 0001	An efficient scheme for complete exchange in 2D tori.	IPPS	1995	DBLP DOI BibTeX RDF	2D tori, wormhole-routed tori, bisection bandwidth, parallel algorithms, parallel computing, multiprocessor interconnection networks, mesh networks, complete exchange, all-to-all personalized communication
29	Sabine R. Öhring, Maximilian Ibel, Sajal K. Das 0001, Mohan Kumar	On generalized fat trees.	IPPS	1995	DBLP DOI BibTeX RDF	generalized fat trees, multiprocesser interconnection networks, connection machine architecture, pruned butterflies, fat tree based architecture, inner nodes, leaf processors, recursive scalability, maximal fault-tolerance, logarithmic diameter bisection scalability, fault tolerant self-routing, reliability, parallel architectures, fault tolerant computing, broadcasting, hypercubes, multiprocessor interconnection networks, trees, meshes, communication complexity, symmetry, routers, network routing, switches, rings, pyramids, tori, CM-5
29	John R. Gilbert, Gary L. Miller, Shang-Hua Teng	Geometric mesh partitioning: implementation and experiments.	IPPS	1995	DBLP DOI BibTeX RDF	geometric mesh partitioning, equal-sized pieces, geometric coordinates, mesh vertices, Matlab code, spectral bisection, computational geometry, mesh generation, finite element analysis, irregular mesh, finite element meshes
29	Ralf Diekmann, Reinhard Lüling, Burkhard Monien, Carsten Spräner	A parallel local-search algorithm for the k-partitioning problem.	HICSS (2)	1995	DBLP DOI BibTeX RDF	parallel local-search algorithm, k-partitioning problem, helpful sets, abstraction technique, runtime dynamic graph shrinking, MIMD systems, parallel algorithms, computational complexity, graph theory, heuristics, search problems, computation times, heuristic programming, stochastic methods, parallel efficiency, graph bisection, solution quality, processor numbers
29	Steven L. Scott, James R. Goodman	The Impact of Pipelined Channels on k-ary n-Cube Networks.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	pipelined channels, bisection constraints, optimaldimensionality, pipelined-channel networks, switching overhead, performance evaluation, multiprocessor interconnection networks, pipeline processing, cycle time, k-ary n-cube networks, message lengths
28	Yong-Hyuk Kim	An Enzyme-Inspired Approach to Surmount Barriers in Graph Bisection.	ICCSA (1)	2008	DBLP DOI BibTeX RDF
28	John Y. Oliver, Diana Franklin, Frederic T. Chong, Venkatesh Akella	Using Application Bisection Bandwidth to Guide Tile Size Selection for the Synchroscalar Tile-Based Architecture.	Trans. High Perform. Embed. Archit. Compil.	2007	DBLP DOI BibTeX RDF
28	K. Wendy Tang, Ridha Kamoua	An Upper Bound for the Bisection Width of a Diagonal Mesh.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	architectures, Network topologies
28	Xiaomao Liu, Shujuan Cao, Junbin Gao, Jun Zhang 0062	The Kernelized Geometrical Bisection Methods.	ISNN (2)	2007	DBLP DOI BibTeX RDF
28	Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin 0001	Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem.	EvoCOP	2006	DBLP DOI BibTeX RDF
28	Inwook Hwang, Yong-Hyuk Kim, Byung Ro Moon	Multi-attractor gene reordering for graph bisection.	GECCO	2006	DBLP DOI BibTeX RDF	gene reordering, repairing scheme, schema preprocessing, vertex ordering, genetic algorithm, graph partitioning
28	Huaxi Gu, Qiming Xie, Kun Wang 0001, Jie Zhang 0003, Yunsong Li	X-Torus: A Variation of Torus Topology with Lower Diameter and Larger Bisection Width.	ICCSA (5)	2006	DBLP DOI BibTeX RDF
28	Johannes Mayer	Adaptive Random Testing by Bisection with Restriction.	ICFEM	2005	DBLP DOI BibTeX RDF
28	Ameya R. Agnihotri, Satoshi Ono, Patrick H. Madden	Recursive bisection placement: feng shui 5.0 implementation details.	ISPD	2005	DBLP DOI BibTeX RDF	mixed block design, placement, floorplanning
28	Johannes Mayer	Adaptive Random Testing by Bisection and Localization.	FATES	2005	DBLP DOI BibTeX RDF
28	Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin 0001	LP-based Genetic Algorithm for the Minimum Graph Bisection Problem.	OR	2005	DBLP DOI BibTeX RDF
28	Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon	Approximation schemes for Metric Bisection and partitioning.	SODA	2004	DBLP BibTeX RDF
28	Subhash Khot	Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique.	FOCS	2004	DBLP DOI BibTeX RDF
28	Ateen Khatkhate, Chen Li 0004, Ameya R. Agnihotri, Mehmet Can Yildiz, Satoshi Ono, Cheng-Kok Koh, Patrick H. Madden	Recursive bisection based mixed block placement.	ISPD	2004	DBLP DOI BibTeX RDF	mixed block design, placement, floorplanning
28	Spencer D. Shellman, Kris Sikorski	Algorithm 825: A deep-cut bisection envelope algorithm for fixed points.	ACM Trans. Math. Softw.	2003	DBLP DOI BibTeX RDF	nonlinear partial differential equations, game theory, economics, Fixed points
28	Marek Karpinski	Approximability of the Minimum Bisection Problem: An Algorithmic Challenge.	MFCS	2002	DBLP DOI BibTeX RDF
28	Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Stefan Tschöke	A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract).	STACS	1997	DBLP DOI BibTeX RDF
28	Dorothea Wagner, Frank Wagner 0001	Between Min Cut and Graph Bisection.	MFCS	1993	DBLP DOI BibTeX RDF
28	R. Baker Kearfott, Manuel Novoa	Algorithm 681: INTBIS, a portable interval Newton/bisection package.	ACM Trans. Math. Softw.	1990	DBLP DOI BibTeX RDF
22	Kenneth Weiss 0001, Leila De Floriani	Supercubes: A High-Level Primitive for Diamond Hierarchies.	IEEE Trans. Vis. Comput. Graph.	2009	DBLP DOI BibTeX RDF
22	Ralf Morgenstern, Marcus Heldmann, Thomas F. Münte, Bodo Vogt	Evaluation of Probabilities and Brain Activity - An EEG-Study.	Brain Informatics	2009	DBLP DOI BibTeX RDF
22	Jun Liu 0003, Jieping Ye	Efficient Euclidean projections in linear time.	ICML	2009	DBLP DOI BibTeX RDF
22	Saeedeh Bakhshi, Hamid Sarbazi-Azad	Efficient VLSI Layout of Edge Product Networks.	DELTA	2008	DBLP DOI BibTeX RDF	Edge graph product, Collinear layout, Interconnection networks, Networks on chip, VLSI layout
22	Yongduek Seo, Richard I. Hartley	A Fast Method to Minimize L Error Norm for Geometric Vision Problems.	ICCV	2007	DBLP DOI BibTeX RDF
22	Raimund Ubar, Sergei Kostin, Jaan Raik, Teet Evartson, Harri Lensen	Fault Diagnosis in Integrated Circuits with BIST.	DSD	2007	DBLP DOI BibTeX RDF
22	Ekasit Kijsipongse, Sudsanguan Ngamsuriyaroj	Column-Based Partitioning for Data in High Dimensional Space.	ICPP	2007	DBLP DOI BibTeX RDF
22	Shaoying Wang, Huaxi Gu, Changshan Wang	RTOIN: a new scalable optical interconnection network.	Infoscale	2007	DBLP DOI BibTeX RDF	scalability, parallel computing, torus, ring, optical interconnection network
22	Mikael Onsjö, Osamu Watanabe 0001	A Simple Message Passing Algorithm for Graph Partitioning Problems.	ISAAC	2006	DBLP DOI BibTeX RDF
22	Giulia Galbiati, Francesco Maffioli	Approximating Maximum Cut with Limited Unbalance.	WAOA	2006	DBLP DOI BibTeX RDF	approximation algorithm, randomized algorithm, semidefinite programming