1327 search results - page 56 / 266 » Path following algorithm for the graph matching problem |
ESA
2004
Springer
15 years 7 months ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
150
click to vote
IOR
2011
14 years 8 months ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
EDBTW
2010
Springer
15 years 8 months ago
2010
Springer
Graph composition has applications in a variety of practical applications. In drug development, for instance, in order to understand possible drug interactions, one has to merge k...
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
105
click to vote
IJCV
2002
15 years 1 months ago
2002
This paper describes a new algorithm for disparity estimation using trinocular stereo. The three cameras are placed in a right angled configuration. A graph is then constructed wh...