Sciweavers

134 search results - page 13 / 27
» A note on generalized chromatic number and generalized girth
Sort
View
79
Voted
ICALP
2010
Springer
15 years 4 months ago
Additive Spanners in Nearly Quadratic Time
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
David P. Woodruff
ICGA
2006
128views Optimization» more  ICGA 2006»
14 years 11 months ago
Never-Ending Moves in Bao
Bao is a member of the large family of mancala games. It is generally considered to be the most complex mancala game with respect to the number of game rules (Townshend, 1986; De ...
Tom Kronenburg, H. H. L. M. Donkers, Alex J. de Vo...
91
Voted
NETWORKS
2010
14 years 10 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...
93
Voted
TOMS
2010
106views more  TOMS 2010»
14 years 10 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
ICIP
2009
IEEE
14 years 9 months ago
New image processing challenges for jointly designed electro-optical imaging systems
Still-image processing algorithms are tailored to and depend crucially upon the properties of the class of images to which they are applied, for instance natural images in consumer...
M. Dirk Robinson, David G. Stork