𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Maximum Degree & Diameter-Bounded Subgraph and its Applications

✍ Scribed by Anthony Dekker, Hebert Pérez-Rosés, Guillermo Pineda-Villavicencio, Paul Watters

Book ID
118801222
Publisher
Springer Netherlands
Year
2012
Tongue
English
Weight
571 KB
Volume
11
Category
Article
ISSN
1570-1166

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An ILP formulation and genetic algorithm
An ILP formulation and genetic algorithm for the Maximum Degree-Bounded Connected Subgraph problem
✍ Milena Bogdanović 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 344 KB

A general instance of a Degree-Constrained Subgraph problem may be found in an edgeweighted or vertex-weighted graph G whereas the objective is to find an optimal weighted subgraph, subject to certain degree constraints on the vertices of the subgraph. This class of combinatorial problems has been e

Forbidden subgraphs and bounds on the si
Forbidden subgraphs and bounds on the size of a maximum matching
✍ Michael D. Plummer; Akira Saito 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

## Abstract Let __K__~1,__n__~ denote the star on __n__ + 1 vertices; that is, __K__~1,__n__~ is the complete bipartite graph having one vertex in the first vertex class of its bipartition and __n__ in the second. The special graph __K__~1,3~, called the __claw__, has received much attention in the