The modern science of networks has brought significant advances to our understanding of
complex systems. One of the most relevant features of graphs representing real systems is …

In this survey we overview the definitions and methods for graph clustering, that is, finding
sets of “related” vertices in graphs. We review the many definitions for what is a cluster in a …

NP-hardness of Euclidean sum-of-squares clustering Page 1 Mach Learn (2009) 75: 245–248
DOI 10.1007/s10994-009-5103-0 NP-hardness of Euclidean sum-of-squares clustering Daniel …

Algorithms for VLSI Physical Design Automation, Second Edition is a core reference text for
graduate students and CAD professionals. Based on the very successful First Edition, it …

In this paper, we establish max-flow min-cut theorems for several important classes of
multicommodity flow problems. In particular, we show that for any n-node multicommodity …

Random projection is a simple geometric technique for reducing the dimensionality of a set
of points in Euclidean space while preserving pairwise distances approximately. The …

The paper is concerned with tools for the quantitative analysis of finite Markov chains whose
states are combinatorial structures. Chains of this kind have algorithmic applications in many …

This survey describes research directions in netlist partitioning during the past two decades
in terms of both problem formulations and solution approaches. We discuss the traditional …

In a centrally controlled system consensus is often reached by decree: the central entity in
charge of the system dictates the" consensus" to the rank-and-file. The situation is vastly …

The cluster structure of many real-world graphs is of great interest, as the clusters may
correspond eg to communities in social networks or to cohesive modules in software …