𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An exact algorithm for solving the vertex separator problem

✍ Scribed by Mohamed Didi Biha; Marie-Jean Meurs


Publisher
Springer US
Year
2010
Tongue
English
Weight
166 KB
Volume
49
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


An exact Block–Newton algorithm for solv
✍ Miguel Ángel FernΓ‘ndez; Marwan Moubachir πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 103 KB

In this Note, we introduce a partitioned Newton based method for solving nonlinear coupled systems arising in the numerical approximation of fluid-structure interaction problems. The originality of this Schur-Newton algorithm lies in the exact Jacobians evaluation involving the fluid-structure linea

An Efficient Exact Algorithm for Constra
✍ Henning Fernau; Rolf Niedermeier πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 382 KB

The constraint bipartite vertex cover problem (CBVC for short) is as follows: given a bipartite graph G with n vertices and two positive integers k 1 k 2 , is there a vertex cover taking at most k 1 vertices from one and at most k 2 vertices from the other vertex set of G? CBVC is NP-complete. It fo