[图书][B] Graph partitioning

CE Bichot, P Siarry - 2013 - books.google.com
Graph partitioning is a theoretical subject with applications in many areas, principally:
numerical analysis, programs mapping onto parallel architectures, image segmentation …

[图书][B] Handbook of bioinspired algorithms and applications

S Olariu, AY Zomaya - 2005 - books.google.com
This authoritative handbook reveals the connections between bioinspired techniques and
the development of solutions to problems that arise in diverse problem domains. It provides …

Relaxation-based coarsening and multiscale graph organization

D Ron, I Safro, A Brandt - Multiscale Modeling & Simulation, 2011 - SIAM
In this paper we generalize and improve the multiscale organization of graphs by
introducing a new measure that quantifies the “closeness” between two nodes. The …

SBV-Cut: Vertex-cut based graph partitioning using structural balance vertices

M Kim, KS Candan - Data & Knowledge Engineering, 2012 - Elsevier
Graphs are used for modeling a large spectrum of data from the web, to social connections
between individuals, to concept maps and ontologies. As the number and complexities of …

An efficient memetic algorithm for the graph partitioning problem

P Galinier, Z Boujbel… - Annals of Operations …, 2011 - Springer
Given a graph and an integer k, the goal of the graph partitioning problem is to find a
partition of the vertex set in k classes, while minimizing the number of cut edges, and …

Comparison of coarsening schemes for multilevel graph partitioning

C Chevalier, I Safro - International Conference on Learning and Intelligent …, 2009 - Springer
Graph partitioning is a well-known optimization problem of great interest in theoretical and
applied studies. Since the 1990s, many multilevel schemes have been introduced as a …

Distributed vertex-cut partitioning

F Rahimian, AH Payberah, S Girdzijauskas… - … 2014, Held as Part of the …, 2014 - Springer
Graph processing has become an integral part of big data analytics. With the ever increasing
size of the graphs, one needs to partition them into smaller clusters, which can be managed …

A distributed algorithm for large-scale graph partitioning

F Rahimian, AH Payberah, S Girdzijauskas… - ACM Transactions on …, 2015 - dl.acm.org
Balanced graph partitioning is an NP-complete problem with a wide range of applications.
These applications include many large-scale distributed problems, including the optimal …

Solving the mesh-partitioning problem with an ant-colony algorithm

P Korošec, J Šilc, B Robič - Parallel computing, 2004 - Elsevier
Many real-world engineering problems can be expressed in terms of partial differential
equations and solved by using the finite-element method, which is usually parallelised, ie …

Ant algorithm for smart water network partitioning

A Di Nardo, M Di Natale, R Greco… - Procedia Engineering, 2014 - Elsevier
Applying ICT devices to WDS makes it possible to introduce also the new concept of Smart
WAter Network (SWAN), as a key Smart City subsystem, improving the traditional …