Sciweavers

7840 search results - page 42 / 1568
» On generalized Ramsey numbers
Sort
View
JGT
2006
98views more  JGT 2006»
15 years 1 months ago
Group chromatic number of planar graphs of girth at least 4
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
Hong-Jian Lai, Xiangwen Li
RSA
2002
81views more  RSA 2002»
15 years 1 months ago
Decycling numbers of random regular graphs
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
Sheng Bau, Nicholas C. Wormald, Sanming Zhou
JUCS
2010
130views more  JUCS 2010»
15 years 10 days ago
On the Linear Number of Matching Substrings
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
Yo-Sub Han
CDC
2010
IEEE
115views Control Systems» more  CDC 2010»
14 years 9 months ago
Distributed statistical estimation of the number of nodes in sensor networks
The distributed estimation of the number of active sensors in a network can be important for estimation and organization purposes. We propose a design methodology based on the foll...
Damiano Varagnolo, Gianluigi Pillonetto, Luca Sche...
JCT
2011
108views more  JCT 2011»
14 years 9 months ago
The number of extreme points of tropical polyhedra
The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define...
Xavier Allamigeon, Stéphane Gaubert, Ricard...