796 search results - page 35 / 160 » The Anonymous Subgraph Problem |
SDM
2008
SIAM
15 years 2 months ago
2008
SIAM
Understanding the general properties of real social networks has gained much attention due to the proliferation of networked data. The nodes in the network are the individuals and...
102
Voted
CERA
2004
15 years 16 days ago
2004
: A secure electronic cash scheme and its role-based access control (RBAC) management are proposed in this paper. The scheme uses electronic cash for payment transactions. In this ...
104
Voted
MP
2007
15 years 5 days ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
115
Voted
IS
2007
15 years 17 days ago
2007
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
125
Voted
EDBT
2012
ACM
13 years 3 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...