2304 search results - page 142 / 461 » On the Vulnerability of Large Graphs |
168
click to vote
SIROCCO
2000
15 years 7 months ago
2000
A graph with n vertices and maximum degree cannot be given weak sense of direction using less than colours. It is known that n colours are always sufficient, but it has been conje...
267
click to vote
MLQ
2011
15 years 1 months ago
2011
Given a graph G whose set of vertices is a Polish space X, the weak Borel chromatic number of G is the least size of a family of pairwise disjoint G-independent Borel sets that cov...
144
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
161
click to vote
WAW
2009
Springer
16 years 25 days ago
2009
Springer
Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usuall...
138
click to vote
ICMCS
2008
IEEE
16 years 20 days ago
2008
IEEE
In this paper, we propose a Semantic Graphs for Image Search (SGIS) system, which provides a novel way for image search by utilizing collaborative knowledge in Wikipedia and netwo...