Balanced Graph Partitioning

Article Properties
Cite
Andreev, Konstantin, and Harald Racke. “Balanced Graph Partitioning”. Theory of Computing Systems, vol. 39, no. 6, 2006, pp. 929-3, https://doi.org/10.1007/s00224-006-1350-7.
Andreev, K., & Racke, H. (2006). Balanced Graph Partitioning. Theory of Computing Systems, 39(6), 929-939. https://doi.org/10.1007/s00224-006-1350-7
Andreev K, Racke H. Balanced Graph Partitioning. Theory of Computing Systems. 2006;39(6):929-3.
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
You May Also Like
Citations
Login
Citations Analysis
Category Category Repetition
Science: Mathematics: Instruments and machines: Electronic computers. Computer science63
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software45
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware44
Science: Science (General): Cybernetics: Information theory34
Technology: Engineering (General). Civil engineering (General)22
The first research to cite this article was titled Graph partitioning by multi-objective real-valued metaheuristics: A comparative study and was published in 2011. The most recent citation comes from a 2024 study titled Graph partitioning by multi-objective real-valued metaheuristics: A comparative study . This article reached its peak citation in 2020 , with 17 citations.It has been cited in 90 different journals, 12% of which are open access. Among related journals, the Proceedings of the VLDB Endowment cited this research the most, with 8 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year