2304 search results - page 156 / 461 » On the Vulnerability of Large Graphs |
179
click to vote
IPL
2010
15 years 5 months ago
2010
The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used ...
195
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
176
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Extensive and automated data integration in bioinformatics facilitates the construction of large, complex biological networks. However, the challenge lies in the inter...
201
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
We consider extending decision support facilities toward large sophisticated networks, upon which multidimensional attributes are associated with network entities, thereby forming...
177
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...