1327 search results - page 13 / 266 » Path following algorithm for the graph matching problem |
93
Voted
IJFCS
2007
14 years 9 months ago
2007
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
85
Voted
JSYML
2010
14 years 4 months ago
2010
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
109
click to vote
APPROX
2000
Springer
15 years 1 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
AAIM
2007
Springer
15 years 1 months ago
2007
Springer
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...