Sciweavers

10 search results - page 1 / 2
» siamdm 1998
Sort
View
79
Voted
SIAMDM
1998
65views more  SIAMDM 1998»
14 years 10 months ago
A Greedy Algorithm Estimating the Height of Random Trees
Tomasz Luczak
SIAMDM
1998
87views more  SIAMDM 1998»
14 years 10 months ago
Sorting by Transpositions
Vineet Bafna, Pavel A. Pevzner
64
Voted
SIAMDM
1998
53views more  SIAMDM 1998»
14 years 10 months ago
Two Arc-Disjoint Paths in Eulerian Digraphs
András Frank, Toshihide Ibaraki, Hiroshi Na...
69
Voted
SIAMDM
1998
64views more  SIAMDM 1998»
14 years 10 months ago
The Ring Loading Problem
Alexander Schrijver, Paul D. Seymour, Peter Winkle...
90
Voted
SIAMDM
1998
165views more  SIAMDM 1998»
14 years 10 months ago
The Number of Independent Sets in a Grid Graph
If f(m, n) is the (vertex) independence number of the m × n grid graph, then we show that the double limit η = def limm,n→∞ f(m, n) 1 mn exists, thereby refining earlier res...
Neil J. Calkin, Herbert S. Wilf