1327 search results - page 86 / 266 » Path following algorithm for the graph matching problem |
105
Voted
ASUNAM
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
101
click to vote
WWW
2006
ACM
16 years 2 months ago
2006
ACM
An XML range query may impose predicates on the numerical or textual contents of the elements and/or their respective path structures. In order to handle content and structure ran...
140
click to vote
KDD
2004
ACM
15 years 7 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
136
click to vote
COMAD
2008
15 years 3 months ago
2008
Although many algorithms have been proposed for evaluating XPath queries containing un-ordered axes (child, descendant, parent and ancestor) against streaming XML data, there are ...
135
click to vote
DAC
1997
ACM
15 years 6 months ago
1997
ACM
: Hardware-software co-synthesis is the process of partitioning an embedded system specification into hardware and software modules to meet performance, power and cost goals. In t...