A survey of graph layout problems
ACM Computing Surveys (CSUR)
Constant factor approximation of vertex-cuts in planar graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On the complexity of finding balanced oneway cuts
Information Processing Letters
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT
Theoretical Computer Science
Inoculation strategies for victims of viruses and the sum-of-squares partition problem
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A spectral heuristic for bisecting random graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Algorithms (TALG)
Finding small balanced separators
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Inoculation strategies for victims of viruses and the sum-of-squares partition problem
Journal of Computer and System Sciences
Pricing of partially compatible products
Proceedings of the 8th ACM conference on Electronic commerce
Finding dense and isolated submarkets in a sponsored search spending graph
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Throughput-driven synthesis of embedded software for pipelined execution on multicore architectures
ACM Transactions on Embedded Computing Systems (TECS)
Balanced cut approximation in random geometric graphs
Theoretical Computer Science
Simple cuts are fast and good: optimum right-angled cuts in solid grids
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Balanced cut approximation in random geometric graphs
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Computer Science Review
The little engine(s) that could: scaling online social networks
IEEE/ACM Transactions on Networking (TON)
Restreaming graph partitioning: simple versatile algorithms for advanced balancing
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
FENNEL: streaming graph partitioning for massive scale graphs
Proceedings of the 7th ACM international conference on Web search and data mining
| Hi-index | 0.00 |
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. It is known that finding a bisection of minimum cost is NP-hard. We present an algorithm that finds a bisection whose cost is within ratio of O(log2 n) from the minimum. For graphs excluding any fixed graph as a minor (e.g., planar graphs) we obtain an improved approximation ratio of O(log n). The previously known approximation ratio for bisection was roughly $\sqrt{n}$.