302 search results - page 1 / 61 » Efficient Algorithms for the Longest Path Problem |
83
Voted
ISAAC
2004
Springer
15 years 5 months ago
2004
Springer
110
Voted
IJFCS
2007
15 years 4 days 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...
93
Voted
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
117
Voted
CATA
2006
15 years 1 months ago
2006
The paper presents a load balancing method for some CGM (Coarse-Grained Multicomputer) algorithms. This method can be applied on different dynamic programming problems such as: Lo...
132
click to vote
IPL
2007
15 years 3 days ago
2007
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...