776 search results - page 87 / 156 » Network Applications of Graph Bisimulation |
CCS
2003
ACM
14 years 3 months ago
2003
ACM
Understanding the strategies of attacks is crucial for security applications such as computer and network forensics, intrusion response, and prevention of future attacks. This pap...
KDD
2008
ACM
14 years 10 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
APPROX
2006
Springer
14 years 1 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
COCOON
2007
Springer
14 years 4 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
ICDE
2009
IEEE
13 years 7 months ago
2009
IEEE
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...