61 search results - page 6 / 13 » siamdm 2010 |
SIAMDM
2010
14 years 4 months ago
2010
Every 3-graph in which no four vertices are independent and no four vertices span precisely three edges must have edge density 4/9(1 - o(1)). This bound is tight. The proof is a r...
SIAMDM
2010
14 years 4 months ago
2010
Sorting permutations by transpositions is an important and difficult problem in genome rearrangements. The transposition diameter TD(n) is the maximum transposition distance among ...
SIAMDM
2010
14 years 4 months ago
2010
If m 2 is constant and 0 r log log n for a small positive constant , then whp a random walk with look-ahead r on a scale-free graph G = G(m, n) has cover time CG(r) (2/(mr-1(...
SIAMDM
2010
14 years 4 months ago
2010
We revisit the problem of pursuit-evasion in a grid introduced by Sugihara and Suzuki in the lineof-sight vision model. Consider an arbitrary evader Z with the maximum speed of 1 ...
SIAMDM
2010
14 years 4 months ago
2010
We investigate algebraic structures that can be placed on vertices of the multiplihedra, a family of polytopes originating in the study of higher categories and homotopy theory. Mo...