1172 search results - page 19 / 235 » Path Algorithms on Regular Graphs |
SMC
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
SIAMCOMP
2010
13 years 6 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
ACSC
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
DSD
2006
IEEE
14 years 1 months ago
2006
IEEE
The rising complexity, customization and short time to market of modern digital systems requires automatic methods for generation of high performance architectures for such system...
MFCS
2009
Springer
14 years 2 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 ...