✦ LIBER ✦

Linear arrangement problems on recursively partitioned graphs

✍ Scribed by T. Lengauer; R. Müller

Book ID: 105401886
Publisher: Springer
Year: 1988
Tongue: English
Weight: 779 KB
Volume: 32
Category: Article
ISSN: 0340-9422
DOI: 10.1007/bf01928924

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The linear arrangement problem on recurs

The linear arrangement problem on recursively constructed graphs

✍ S. B. Horton; T. Easton; R. Gary Parker 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB

A linear time algorithm for graph partit

A linear time algorithm for graph partition problems

✍ L.H. Clark; F. Shahrokhi; L.A. Székely 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 483 KB

On the sum-max graph partitioning proble

On the sum-max graph partitioning problem

✍ Watrigant, Rémi; Bougeret, Marin; Giroudeau, Rodolphe; König, Jean-Claude 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 694 KB

Linear and quadratic programming approac

Linear and quadratic programming approaches for the general graph partitioning problem

✍ Neng Fan; Panos M. Pardalos 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 269 KB

A simple linear time algorithm for the d

A simple linear time algorithm for the domatic partition problem on strongly chordal graphs

✍ Shen-Lung Peng; Maw-Shang Chang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 355 KB

On the complexity of graph tree partitio

On the complexity of graph tree partition problems

✍ Roberto Cordone; Francesco Maffioli 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 270 KB

This paper concerns the optimal partition of a graph into p connected clusters of vertices, with various constraints on their topology and weight. We consider di erent objectives, depending on the cost of the trees spanning the clusters. This rich family of problems mainly applies to telecommunicati