Sciweavers

201 search results - page 7 / 41
» The Connectivity of addition Cayley graphs
Sort
View
FSTTCS
2008
Springer
13 years 8 months ago
Pruning 2-Connected Graphs
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
Chandra Chekuri, Nitish Korula
IANDC
2008
141views more  IANDC 2008»
13 years 7 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
COMBINATORICS
2007
42views more  COMBINATORICS 2007»
13 years 7 months ago
Graphs with Chromatic Roots in the Interval (1, 2)
We present an infinite family of 3-connected non-bipartite graphs with chromatic roots in the interval (1, 2) thus resolving a conjecture of Jackson’s in the negative. In addit...
Gordon F. Royle
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
11 years 9 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 7 months ago
Index coding via linear programming
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky