9532 search results - page 141 / 1907 » Logic, Graphs, and Algorithms |
45
Voted
STOC
2002
ACM
15 years 11 months ago
2002
ACM
108
click to vote
WADS
2005
Springer
15 years 4 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
103
click to vote
WEBI
2007
Springer
15 years 5 months ago
2007
Springer
Detecting densely connected subgroups in graphs such as communities in social networks is of interest in many research fields. Several methods have been developed to find commun...
IPPS
2000
IEEE
15 years 3 months ago
2000
IEEE
Parallel solution of irregular problems require solving the graph partitioning problem. The extended eigenproblem appears as the solution of some relaxed formulations of the graph ...
ICAPR
2005
Springer
15 years 4 months ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...