776 search results - page 32 / 156 » Network Applications of Graph Bisimulation |
CORR
2011
Springer
13 years 5 months ago
2011
Springer
Abstract. Most instruments - formalisms, concepts, and metrics for social networks analysis fail to capture their dynamics. Typical systems exhibit different scales of dynamics, ra...
KDD
2005
ACM
14 years 10 months ago
2005
ACM
Abstract. The application of kernel methods to link analysis is explored. We argue that a family of kernels on graphs provides a unified perspective on the three measures proposed ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Let H = (V, E) be a hypergraph. A conflict-free coloring of H is an assignment of colors to V such that in each hyperedge e E there is at least one uniquely-colored vertex. This ...
ICPP
2006
IEEE
14 years 4 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
KDD
2010
ACM
14 years 4 days ago
2010
ACM
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not ...