SIAMDM
2010
13 years 7 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
13 years 7 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
SIAMDM
2010
13 years 7 months ago
2010
The domination game played on a graph G consists of two players, Dominator and Staller who alternate taking turns choosing a vertex from G such that whenever a vertex is chosen by...
SIAMDM
2010
13 years 7 months ago
2010
We establish a stronger symmetry between the numbers of northeast and southeast chains in the context of 01-fillings of moon polyominoes. Let M be a moon polyomino with n rows and...
SIAMDM
2010
13 years 7 months ago
2010
Inspired by the convex program of Eisenberg and Gale which captures Fisher markets with linear utilities, Jain and Vazirani [STOC, 2007] introduced the class of EisenbergGale (EG)...
SIAMDM
2010
13 years 7 months ago
2010
SIAMDM
2010
13 years 7 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
13 years 7 months ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
SIAMDM
2010
13 years 7 months ago
2010
The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupy a differe...
SIAMDM
2010
13 years 7 months ago
2010
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...