2463 search results - page 192 / 493 » Rankings of Directed Graphs |
131
Voted
IPL
2010
15 years 2 months ago
2010
The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used ...
128
Voted
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
A new graph-based evolutionary algorithm named “Genetic Network Programming, GNP” has been proposed. GNP represents its solutions as directed graph structures, which can improv...
147
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
129
Voted
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
Genomic maps often do not specify the order within some groups of two or more markers. The synthesis of a master map from several sources introduces additional order ambiguity due ...
136
Voted
ISCAS
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...