✦ LIBER ✦

Compact Mathematical Formulation for Graph Partitioning

✍ Scribed by Marc Boulle

Book ID: 111602956
Publisher: Springer US
Year: 2004
Tongue: English
Weight: 103 KB
Volume: 5
Category: Article
ISSN: 1389-4420
DOI: 10.1023/b:opte.0000038889.84284.c7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Compact graphs and equitable partitions

✍ C.D. Godsil 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 524 KB

Let G be a graph with adjacency matrix A, and let I-be the set of all permutation matrices which commute with A. We call G compact if every doubly stochastic matrix which commutes with A is a convex combination of matrices from I'. We characterize the graphs for which S( A) = {I} and show that the a

Process Partitioning through Graph Compa

Process Partitioning through Graph Compaction

✍ D. Karabeg 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 989 KB

This paper is concerned with process partitioning that arises in practice in preprocessing of programs for the MIMD parallel machines without shared memory. The graph compaction combinatorial optimization problem is defined and proposed as a model of process partitioning. This problem is proved to b

Graph Partitioning (Bichot/Graph Partiti

Graph Partitioning (Bichot/Graph Partitioning) || Appendix: The Main Tools and Test Benches for Graph Partitioning

✍ Bichot, Charles-Edmond; Siarry, Patrick 📂 Article 📅 2013 🏛 John Wiley & Sons, Inc. ⚖ 206 KB

Algorithms for Partition of Some Class o

Algorithms for Partition of Some Class of Graphs under Compaction and Vertex-Compaction

✍ Narayan Vikas 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 811 KB

Formulations and valid inequalities for

Formulations and valid inequalities for the node capacitated graph partitioning problem

✍ C. E. Ferreira; A. Martin; C. C. de Souza; R. Weismantel; L. A. Wolsey 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 910 KB

Algorithms for partitioning a graph

✍ Taehoon Park; Chae Y. Lee 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 606 KB