1327 search results - page 165 / 266 » Path following algorithm for the graph matching problem |
105
click to vote
CONIELECOMP
2005
IEEE
15 years 7 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
113
click to vote
ANCS
2007
ACM
15 years 6 months ago
2007
ACM
To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID) in the InfiniBand specification, must be assigned to the destination and used in the forwar...
124
click to vote
KDD
2006
ACM
16 years 2 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
125
click to vote
ALGORITHMICA
1998
15 years 1 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
SWAT
2004
Springer
15 years 7 months ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...