✦ LIBER ✦

Minimum Clique Partition in Unit Disk Graphs

✍ Scribed by Adrian Dumitrescu; János Pach

Publisher: Springer Japan
Year: 2011
Tongue: English
Weight: 269 KB
Volume: 27
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-011-1026-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Weakly Robust PTAS for Minimum Clique

A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs

✍ Imran A. Pirwani; Mohammad R. Salavatipour 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 763 KB

Clique covering and clique partition in

Clique covering and clique partition in generalizations of line graphs

✍ Erich Prisner 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Tighter Approximation Bounds for Minimum

Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs

✍ Minming Li; Peng-Jun Wan; Frances Yao 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 740 KB

Algorithms for the minimum partitioning

Algorithms for the minimum partitioning problems in graphs

✍ Hiroshi Nagamochi 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 545 KB

## Abstract In this paper, the author explains the recent evolution of algorithms for minimum partitioning problems in graphs. When the set of vertices of a graph having non‐negative weights for edges is divided into __k__ subsets, the set of edges for which both endpoints are contained in differen