2304 search results - page 166 / 461 » On the Vulnerability of Large Graphs |
185
click to vote
MFCS
2005
Springer
16 years 9 hour ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
161
click to vote
STACS
2004
Springer
15 years 12 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
167
click to vote
DSD
2003
IEEE
15 years 11 months ago
2003
IEEE
Network on Chip (NoC) is a new paradigm for designing core based System on Chip which supports high degree of reusability and is scalable. In this paper we describe an efficient t...
159
click to vote
ARC
2007
Springer
15 years 10 months ago
2007
Springer
Many important algorithms in computational biology and related subjects rely on the ability to extract and to identify sub-graphs of larger graphs; an example is to find common fun...
177
click to vote
AAAI
2007
15 years 8 months ago
2007
RDF (“Resource Description Framework”) is now a widely used World Wide Web Consortium standard. However, methods to index large volumes of RDF data are still in their infancy....