𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method

✍ Scribed by Gendron, Bernard; Lucena, Abilio; Salles da Cunha, Alexandre; Simonetti, Luidi

Book ID
122855466
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
169 KB
Volume
41
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The degree-preserving spanning tree prob
The degree-preserving spanning tree problem in strongly chordal and directed path graphs
✍ Ching-Chi Lin; Gerard J. Chang; Gen-Huey Chen πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 108 KB

## Abstract Suppose __G__ is a connected graph and __T__ a spanning tree of __G__. A vertex __v__ Ξ΅ __V__(__G__) is said to be a degree‐preserving vertex if its degree in __T__ is the same as its degree in __G__. The degree‐preserving spanning tree problem is to find a spanning tree __T__ of a conn

The full-degree spanning tree problem
The full-degree spanning tree problem
✍ Randeep Bhatia; Samir Khuller; Robert Pless; Yoram J. Sussmann πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 136 KB

The full-degree spanning tree problem is defined as follows: Given a connected graph G G G = (V V V, E E E), find a spanning tree T T T to maximize the number of vertices whose degree in T T T is the same as in G G G (these are called vertices of "full" degree). This problem is NP-hard. We present a