𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Confusion on the Complexity of Calcium Balance

✍ Scribed by Sharon M. Moe


Book ID
109083195
Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
152 KB
Volume
23
Category
Article
ISSN
0894-0959

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the Complexity of Matrix Balancing
✍ Kalantari, B.; Khachiyan, L.; Shokoufandeh, A. πŸ“‚ Article πŸ“… 1997 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 313 KB
On the complexity of finding balanced on
✍ Uriel Feige; Orly Yahalom πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 88 KB

A bisection of an n-vertex graph is a partition of its vertices into two sets S and T , each of size n/2. The bisection cost is the number of edges connecting the two sets. In directed graphs, the cost is the number of arcs going from S to T . Finding a minimum cost bisection is NP-hard for both und