𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Exact algorithms for the vertex separator problem in graphs

✍ Scribed by Cid C. de Souza; Victor F. Cavalcante

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
242 KB
Volume
57
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Separator Theorem for Rooted Directe
The Separator Theorem for Rooted Directed Vertex Graphs
✍ B.S. Panda πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 109 KB

In this note we point out a flaw in the separator theorem for rooted directed vertex graphs due to C. L. Monma and V. K. Wei (1986, J. Combin. Theory Ser. B 41, 141 181), and present a modified separator theorem for the same class of graphs.

Exact algorithms for the master ring pro
Exact algorithms for the master ring problem
✍ Hadas Shachnai; Lisa Zhang; Tomomi Matsui πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 188 KB

## Abstract We consider the master ring problem (MRP) which often arises in optical network design. Given a network which consists of a collection of interconnected rings __R__~1~,…,__R__~__K__~, with __n__~1~,…,__n__~__K__~ distinct nodes, respectively, we need to find an ordering of the nodes in

Two exact algorithms for the vehicle rou
Two exact algorithms for the vehicle routing problem on trees
✍ Pontien Mbaraga; AndrΓ© Langevin; Gilbert Laporte πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 80 KB πŸ‘ 2 views

This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time-constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The othe