The bottleneck graph partition problem consists of partitioning the vertices of an undirected edge-weighted graph into two equally sized sets such that the maximum edge weight in the cut separating the two sets becomes minimum. In this short note, we present an optimum algorithm for this problem wit
✦ LIBER ✦
A note on the asymptotic behaviour of bottleneck problems
✍ Scribed by Hansjörg Albrecher
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 183 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A note on the bottleneck graph partition
✍
Klinz, Bettina; Woeginger, Gerhard J.
📂
Article
📅
1999
🏛
John Wiley and Sons
🌐
English
⚖ 47 KB
👁 2 views
A note on exact algorithms for the bottl
✍
Silvano Martello; Paolo Toth
📂
Article
📅
1995
🏛
Elsevier Science
🌐
English
⚖ 124 KB
A note on asymptotic properties of the q
✍
WanSoo T. Rhee
📂
Article
📅
1988
🏛
Elsevier Science
🌐
English
⚖ 260 KB
On the solution of discrete bottleneck p
✍
Arie Tamir
📂
Article
📅
1982
🏛
Elsevier Science
🌐
English
⚖ 223 KB
Some remarks on the asymptotic behaviour
✍
G. A. Philippin; V. Proytcheva
📂
Article
📅
2005
🏛
John Wiley and Sons
🌐
English
⚖ 103 KB
👁 1 views
## Abstract This paper deals with a class of semilinear parabolic problems. We establish sufficient conditions on the data forcing the solution to blow up at finite time τ and derive an upper bound for τ. Moreover, we show that if the problem is modified in some way, the solution decays exponential
The asymptotic behaviour of quadratic su
✍
Ernesto Bonomi; Jean-Luc Lutton
📂
Article
📅
1986
🏛
Elsevier Science
🌐
English
⚖ 398 KB