Sciweavers

Share
10 search results - page 1 / 2
» On Dissemination Thresholds in Regular and Irregular Graph C...
Sort
View
ALGORITHMICA
2011
8 years 2 months ago
On Dissemination Thresholds in Regular and Irregular Graph Classes
We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active ve...
Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques...
COMBINATORICS
2006
144views more  COMBINATORICS 2006»
8 years 7 months ago
Weighted Zeta Functions of Graph Coverings
We present a decomposition formula for the weighted zeta function of an irregular covering of a graph by its weighted L-functions. Moreover, we give a factorization of the weighte...
Iwao Sato
CORR
2010
Springer
182views Education» more  CORR 2010»
8 years 7 months ago
Component structure induced by a random walk on a random graph
We consider random walks on two classes of random graphs and explore the likely structure of the vacant set viz. the set of unvisited vertices. Let (t) be the subgraph induced by ...
Colin Cooper, Alan M. Frieze
ACCV
2009
Springer
9 years 2 months ago
Transductive Segmentation of Textured Meshes
This paper addresses the problem of segmenting a textured mesh into objects or object classes, consistently with user-supplied seeds. We view this task as transductive learning and...
Anne-Laure Chauve, Jean-Philippe Pons, Jean-Yves A...
CPC
2002
113views more  CPC 2002»
8 years 7 months ago
Some Inequalities For The Largest Eigenvalue Of A Graph
Let (G) be the largest eigenvalue of the adjacency matrix of a graph G: We show that if G is Kp+1-free then (G) r 2 p 1 p e (G): This inequality was ...rst conjectured by Edwards ...
Vladimir Nikiforov
books