✦ LIBER ✦

The Complexity of Bottleneck Labeled Graph Problems

✍ Scribed by Refael Hassin; Jérôme Monnot; Danny Segev

Book ID: 106148985
Publisher: Springer
Year: 2008
Tongue: English
Weight: 482 KB
Volume: 58
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-008-9261-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The bottleneck graph partition problem

✍ Hochbaum, Dorit S.; Pathria, Anu 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 401 KB 👁 2 views

The bottleneck graph partition problem is to partition the nodes of a graph into two equally sized sets, so that the maximum edge weight in the cut separating the two sets is minimum. Whereas the graph partition problem, where the sum of the edge weights in the cut is to be minimized, is NP-hard, th

Complexity of graph embeddability proble

Complexity of graph embeddability problems

✍ C. Benzaken; S. Foldes 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 890 KB

The complexity of some graph colouring p

The complexity of some graph colouring problems

✍ Keith Edwards 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 896 KB

The complexity of two graph orientation

The complexity of two graph orientation problems

✍ Nicole Eggemann; Steven D. Noble 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 198 KB

Expected complexity of graph partitionin

Expected complexity of graph partitioning problems

✍ Luděk Kučera 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 927 KB

A note on the bottleneck graph partition

A note on the bottleneck graph partition problem

✍ Klinz, Bettina; Woeginger, Gerhard J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB 👁 2 views

The bottleneck graph partition problem consists of partitioning the vertices of an undirected edge-weighted graph into two equally sized sets such that the maximum edge weight in the cut separating the two sets becomes minimum. In this short note, we present an optimum algorithm for this problem wit