✦ LIBER ✦

Simple heuristics for unit disk graphs

✍ Scribed by M. V. Marathe; H. Breu; H. B. Hunt III; S. S. Ravi; D. J. Rosenkrantz

Publisher: John Wiley and Sons
Year: 1995
Tongue: English
Weight: 990 KB
Volume: 25
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230250205

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Unit disk graphs

✍ Brent N. Clark; Charles J. Colbourn; David S. Johnson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 878 KB

Bisectored unit disk graphs

✍ John Nolan 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

## Abstract Unit disk graphs form a natural model for cellular radio channel assignment problems under the assumption of equally powerful, omnidirectional transmitters located on a uniform, flat plane. Here, we introduce and give motivation for an extension of this model, namely, sectorization at t

On Coloring Unit Disk Graphs

✍ A. Gräf; M. Stumpf; G. Weißenfels 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 237 KB

Improper coloring of unit disk graphs

✍ Frédéric Havet; Ross J. Kang; Jean-Sébastien Sereni 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 240 KB

## Abstract Motivated by a satellite communications problem, we consider a generalized coloring problem on unit disk graphs. A coloring is __k__‐improper if no more than __k__ neighbors of every vertex have the same colour as that assigned to the vertex. The __k__‐improper chromatic number χ^__k__^

Heuristics for laying out information gr

Heuristics for laying out information graphs

✍ J. L. Ganley; L. S. Heath 📂 Article 📅 1994 🏛 Springer Vienna 🌐 English ⚖ 975 KB

SIMPLE MAX-CUT for unit interval graphs

SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s

✍ Hans L. Bodlaender; Ton Kloks; Rolf Niedermeier 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 56 KB

The SIMPLE MAX-CUT problem can be solved in linear time for unit interval graphs. We show also that for each constant q, the SIMPLE MAX-CUT problem can be solved in polynomial time for (q, q -4)-graphs.