Better Bounds for Graph Bisection-Reference-Cited by-同舟云学术

Better Bounds for Graph Bisection

Published:2012 Issue: Volume: Page:407-418
ISSN:0302-9743
Container-title:Algorithms – ESA 2012
language:
Short-container-title:

Author:

Delling Daniel,Werneck Renato F.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-33090-2_36.pdf

Reference22 articles.

1. Armbruster, M.: Branch-and-Cut for a Semidefinite Relaxation of Large-Scale Minimum Bisection Problems. PhD thesis, Technische Universität Chemnitz (2007)

2. Armbruster, M.: Graph Bisection and Equipartition (2007), http://www.tu-chemnitz.de/mathematik/discrete/armbruster/diss/

3. Lecture Notes in Computer Science;M. Armbruster,2008

4. Bader, D.A., Meyerhenke, H., Sanders, P., Wagner, D.: 10th DIMACS Implementation Challenge: Graph Partitioning and Graph Clustering (2011), http://www.cc.gatech.edu/dimacs10/index.shtml

5. Brunetta, L., Conforti, M., Rinaldi, G.: A branch-and-cut algorithm for the equicut problem. Mathematical Programming 78, 243–263 (1997)

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Memetic Algorithms for Spatial Partitioning Problems;ACM Transactions on Spatial Algorithms and Systems;2023-01-12

2. A distributed algorithm for operating large-scale ridesourcing systems;Transportation Research Part E: Logistics and Transportation Review;2021-12

3. Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm;LEIBNIZ INT PR INFOR;2019

4. A feasible graph partition framework for parallel computing of big graph;Knowledge-Based Systems;2017-10

5. Hub Labels on the database for large-scale graphs with the COLD framework;GeoInformatica;2017-01-16