1327 search results - page 196 / 266 » Path following algorithm for the graph matching problem |
110
click to vote
IJFCS
1998
15 years 1 months ago
1998
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
117
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
122
click to vote
CSFW
2007
IEEE
15 years 8 months ago
2007
IEEE
Signature-based tools such as network intrusion detection systems are widely used to protect critical systems. Automatic signature generation techniques are needed to enable these...
113
click to vote
CIKM
2008
Springer
15 years 3 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
120
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...