The distribution of hard graph coloring problems as a function of graph connectivity is shown to have two distinct transition behaviors. The first, previously recognized, is a peak in the median search cost near the connectivity at which half the graphs have solutions. This region contains a high pr
โฆ LIBER โฆ
Problem on Phase Transitions with Special Constraints
โ Scribed by V. S. Mikhailov
- Book ID
- 110312609
- Publisher
- Springer US
- Year
- 2001
- Tongue
- English
- Weight
- 107 KB
- Volume
- 107
- Category
- Article
- ISSN
- 1573-8795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The hardest constraint problems: A doubl
โ
Tad Hogg; Colin P. Williams
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 1016 KB
A group pursuit problem with phase const
โ
N.N. Petrov
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 265 KB
Linear phase transition in random linear
โ
David Gamarnik
๐
Article
๐
2004
๐
Springer
๐
English
โ 280 KB
Why a special issue on phospholipid phas
โ
Paavo K.J. Kinnunen; Peter Laggner
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 141 KB
A problem of group pursuit with phase co
โ
D.A. Vagin; N.N. Petrov
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 452 KB
The necessary and sufficient conditions for the capture of at least one evader are obtained in a problem of the simple pursuit of evaders by a group of pursuers, subject to the condition that the evaders use the same control and do not leave the limits of a polyhedral set.
On the problem of filters with arbitrary
โ
M. F. Fahmy
๐
Article
๐
1977
๐
John Wiley and Sons
๐
English
โ 301 KB