𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem

✍ Scribed by Abraham P. Punnen; K.P.K. Nair

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
323 KB
Volume
50
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A tabu search algorithm for the Capacita
A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
✍ Sharaiha, Yazid M.; Gendreau, Michel; Laporte, Gilbert; Osman, Ibrahim H. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 150 KB πŸ‘ 2 views

The Capacitated Shortest Spanning Tree Problem consists of determining a shortest spanning tree in a vertex weighted graph such that the weight of every subtree linked to the root by an edge does not exceed a prescribed capacity. We propose a tabu search heuristic for this problem, as well as dynami

A fast-adaptive composite grid algorithm
A fast-adaptive composite grid algorithm for solving the free-space Poisson problem on the cell broadband engine
✍ Daniel Ritter; Markus StΓΌrmer; Ulrich RΓΌde πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 254 KB

## Abstract Fast solvers for Poisson's equation with boundary conditions at infinity are an important building block for molecular dynamics. One issue that arises when this equation is solved numerically is the infinite size of the domain. This prevents a direct solution so that other concepts have