1327 search results - page 191 / 266 » Path following algorithm for the graph matching problem |
113
Voted
KDD
2010
ACM
15 years 5 months ago
2010
ACM
Memory leaks are caused by software programs that prevent the reclamation of memory that is no longer in use. They can cause significant slowdowns, exhaustion of available storag...
153
click to vote
PDCAT
2005
Springer
15 years 7 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
102
Voted
STOC
2010
ACM
15 years 6 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
115
Voted
IWOCA
2009
Springer
15 years 8 months ago
2009
Springer
A circuit in a simple undirected graph G = (V, E) is a sequence of vertices {v1, v2, . . . , vk+1} such that v1 = vk+1 and {vi, vi+i} ∈ E for i = 1, . . . , k. A circuit C is sai...
128
click to vote
KDD
2010
ACM
15 years 5 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...