3204 search results - page 266 / 641 » The b-chromatic Number of a Graph |
115
click to vote
JCT
2007
15 years 20 days ago
2007
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...
100
click to vote
WWW
2008
ACM
16 years 1 months ago
2008
ACM
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...
114
click to vote
KDD
2007
ACM
16 years 1 months ago
2007
ACM
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 ...
115
Voted
STOC
2006
ACM
16 years 1 months ago
2006
ACM
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...
179
Voted
SIGMOD
2008
ACM
16 years 28 days ago
2008
ACM
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...