2304 search results - page 42 / 461 » On the Vulnerability of Large Graphs |
CIKM
2010
Springer
13 years 8 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
SIGMOD
2005
ACM
14 years 3 months ago
2005
ACM
In this paper, we propose new graph-based data structure and indexing to organize and retrieve video data. Several researches have shown that a graph can be a better candidate for...
DM
2010
13 years 9 months ago
2010
The chromatic capacity of a graph G; CAP (G) ; is the largest integer k such that there is a k-colouring of the edges of G such that when the vertices of G are coloured with the s...
JCT
2010
13 years 8 months ago
2010
We prove that for every k and every ε > 0, there exists g such that every graph with tree-width at most k and odd-girth at least g has circular chromatic number at most 2 + ε...
ICDE
2008
IEEE
14 years 11 months ago
2008
IEEE