𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New results for the degree/diameter problem

✍ Scribed by Michael J. Dinneen; Paul R. Hafner

Publisher
John Wiley and Sons
Year
1994
Tongue
English
Weight
489 KB
Volume
24
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A family of graphs and the degree/diamet
A family of graphs and the degree/diameter problem
✍ Geoffrey Exoo πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 64 KB πŸ‘ 1 views

## Abstract We investigate a family of graphs relevant to the problem of finding large regular graphs with specified degree and diameter. Our family contains the largest known graphs for degree/diameter pairs (3, 7), (3, 8), (4, 4), (5, 3), (5, 5), (6, 3), (6, 4), (7, 3), (14, 3), and (16, 2). We a

Approximation Results for the Optimum Co
Approximation Results for the Optimum Cost Chromatic Partition Problem
✍ Klaus Jansen πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 246 KB

In this paper, we study the optimum cost chromatic partition OCCP problem for several graph classes. The OCCP problem is the problem of coloring the vertices of a graph such that adjacent vertices get different colors and that the total coloring cost is minimum. We prove several approximation result

Models and heuristics for the k -degree
Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs
✍ Christophe Duhamel; LuΓ­s Gouveia; Pedro Moura; MaurΓ­cio de Souza πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 319 KB πŸ‘ 1 views

## Abstract The __k__ ‐Degree constrained Minimum Spanning Tree Problem (__k__ ‐DMSTP) consists in finding a minimal cost spanning tree satisfying the condition that every node has a degree no greater than a fixed value __k__. Here we consider an extension where besides the edge costs, a concave co