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
β¦ LIBER β¦
On the complexity of the dual method for maximum balanced flows
β Scribed by Uwe Zimmermann
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 837 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On the complexity of finding balanced on
β
Uriel Feige; Orly Yahalom
π
Article
π
2003
π
Elsevier Science
π
English
β 88 KB
On the complexity of preflow-push algori
β
Levent TunΓ§el
π
Article
π
1994
π
Springer
π
English
β 342 KB
On the maximum number of balancing subse
β
Seiji Nabeya
π
Article
π
1984
π
Elsevier Science
π
English
β 156 KB
On the computational complexity of the m
β
Z. -Q. Luo; D. L. Parnas
π
Article
π
1994
π
Institute of Applied Mathematics, Chinese Academy
π
English
β 617 KB
On the maximum capacity augmentation alg
β
Donald Goldfarb; Jianxiu Hao
π
Article
π
1993
π
Elsevier Science
π
English
β 489 KB
Improved shim method based on the minimi
β
Jongho Lee; Michael Lustig; Dong-hyun Kim; John M. Pauly
π
Article
π
2009
π
John Wiley and Sons
π
English
β 763 KB
## Abstract In this work, a shim method that minimizes the maximum offβresonance frequency (minβmax shim) in balanced steadyβstate free precession (bSSFP) is tested for brain imaging at 3T with constant and linear shim terms. The method demonstrates improvement of spatial coverage and banding artif