Sciweavers

SIAMDM
2010
102views more  SIAMDM 2010»
12 years 11 months ago
The Balanced Decomposition Number and Vertex Connectivity
Shinya Fujita, Henry Liu
SIAMDM
2010
109views more  SIAMDM 2010»
12 years 11 months ago
Ends and Vertices of Small Degree in Infinite Minimally k-(Edge)-Connected Graphs
Bounds on the minimum degree and on the number of vertices attaining it have been much studied for finite edge-/vertex-minimally kconnected/k-edge-connected graphs. We give an ove...
Maya Stein
SIAMDM
2010
92views more  SIAMDM 2010»
12 years 11 months ago
The Limit Shape of Large Alternating Sign Matrices
F. Colomo, A. G. Pronko
SIAMDM
2010
93views more  SIAMDM 2010»
12 years 11 months ago
Thomassen's Choosability Argument Revisited
Thomassen (J. Combin. Theory Ser. B, 62 (1994), pp. 180
David R. Wood, Svante Linusson
SIAMDM
2010
136views more  SIAMDM 2010»
12 years 11 months ago
Obnoxious Centers in Graphs
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...
Sergio Cabello, Günter Rote
SIAMDM
2010
108views more  SIAMDM 2010»
12 years 11 months ago
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing
Jiong Guo, Christian Komusiewicz, Rolf Niedermeier...
SIAMDM
2010
119views more  SIAMDM 2010»
12 years 11 months ago
Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem
The firefighter problem is the following discrete-time game on a graph. Initially, a fire starts at a vertex of the graph. In each round, a firefighter protects one vertex not yet ...
Leizhen Cai, Yongxi Cheng, Elad Verbin, Yuan Zhou
SIAMDM
2010
119views more  SIAMDM 2010»
12 years 11 months ago
A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected ...
Randy Cogill, Cheng Peng
SIAMDM
2010
105views more  SIAMDM 2010»
12 years 11 months ago
The Brunn--Minkowski Inequality and Nontrivial Cycles in the Discrete Torus
Let (Cd m) denote the graph whose set of vertices is Zd m in which two distinct vertices are adjacent iff in each coordinate either they are equal or they differ, modulo m, by at
Noga Alon, Ohad N. Feldheim