ACM Computing Surveys (CSUR)
Efficient partitioning of components
DAC '68 Proceedings of the 5th annual Design Automation Workshop
A study of the effect of user program optimization in a paging system
SOSP '67 Proceedings of the first ACM symposium on Operating System Principles
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
IEEE Transactions on Computers
A Heuristic Procedure for the Partitioning and Mapping of Computer Logic Graphs
IEEE Transactions on Computers
Edge-Bisection of Chordal Rings
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Unsupervised Learning: Self-aggregation in Scaled Principal Component Space
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Extraction of Fuzzy Clusters from Weighted Graphs
PADKK '00 Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications
Multi-way partitioning of VLSI circuits
VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
Spectral and meta-heuristic algorithms for software clustering
Journal of Systems and Software - Special issue: Software reverse engineering
A survey of kernel and spectral methods for clustering
Pattern Recognition
Eigenvalues and graph bisection: An average-case analysis
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Finding near optimal separators in planar graphs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Semi Supervised Spectral Clustering for Regulatory Module Discovery
DILS '08 Proceedings of the 5th international workshop on Data Integration in the Life Sciences
Spectral Clustering in Social Networks
Advances in Web Mining and Web Usage Analysis
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
On bounds for the k-partitioning of graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Profiling users in a 3g network using hourglass co-clustering
Proceedings of the sixteenth annual international conference on Mobile computing and networking
Semidefinite approximations for quadratic programs over orthogonal matrices
Journal of Global Optimization
Segmentation for SAR image based on a new spectral clustering algorithm
LSMS/ICSEE'10 Proceedings of the 2010 international conference on Life system modeling and simulation and intelligent computing, and 2010 international conference on Intelligent computing for sustainable energy and environment: Part III
A metaheuristic based on fusion and fission for partitioning problems
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming
Mathematics of Operations Research
Spectral clustering with more than K eigenvectors
Neurocomputing
Fast density-weighted low-rank approximation spectral clustering
Data Mining and Knowledge Discovery
Genetic approaches for graph partitioning: a survey
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Fast affinity propagation clustering: A multilevel approach
Pattern Recognition
An adaptive multi-start graph partitioning algorithm for structuring cellular networks
Journal of Heuristics
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
A novel method for community detection in complex network using new representation for communities
PAKDD'11 Proceedings of the 15th international conference on New Frontiers in Applied Data Mining
System partitioning and its measure
Journal of Systems and Software
Locally-scaled spectral clustering using empty region graphs
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast semi-supervised clustering with enhanced spectral embedding
Pattern Recognition
Employee workload balancing by graph partitioning
Discrete Applied Mathematics
| Hi-index | 0.00 |
Let a k-partition of a graph be a division of the vertices into k disjoint subsets containing m1 ≥ m2,..., ≥mk vertices. Let Ec be the number of edges whose two vertices belong to different subsets. Let λ1 ≥ λ2, ..., ≥ λk, be the k largest eigenvalues of a matrix, which is the sum of the adjacency matrix of the graph plus any diagonal matrix U such that the suomf all the elements of the sum matrix is zero. Then Ec ≥ 1/2Σr=1k-mrλr. A theorem is given that shows the effect of the maximum degree of any node being limited, and it is also shown that the right-hand side is a concave function of U.C omputational studies are madoef the ratio of upper bound to lower bound for the two-partition of a number of random graphs having up to 100 nodes.