Sciweavers

3757 search results - page 359 / 752
» The overlap number of a graph
Sort
View
DM
2010
103views more  DM 2010»
15 years 6 months ago
Rainbow paths
A k-rainbow path in a graph with colored edges is a path of length k where each edge has a different color. In this note, we settle the problem of obtaining a constructive k-colori...
Domingos Dellamonica Jr., Colton Magnant, Daniel M...
JCT
2007
119views more  JCT 2007»
15 years 6 months ago
Cliques and the spectral radius
We prove a number of relations between the number of cliques of a graph G and the largest eigenvalue (G) of its adjacency matrix. In particular, writing ks (G) for the number of s...
Béla Bollobás, Vladimir Nikiforov
WWW
2008
ACM
16 years 7 months ago
Graph theoretical framework for simultaneously integrating visual and textual features for efficient web image clustering
With the explosive growth of Web and the recent development in digital media technology, the number of images on the Web has grown tremendously. Consequently, Web image clustering...
Manjeet Rege, Ming Dong, Jing Hua
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
16 years 7 months ago
Correlation search in graph databases
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
Yiping Ke, James Cheng, Wilfred Ng
STOC
2006
ACM
174views Algorithms» more  STOC 2006»
16 years 7 months ago
Edge-disjoint paths in Planar graphs with constant congestion
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd