1447 search results - page 89 / 290 » Graphs and Path Equilibria |
134
click to vote
IPMU
2010
Springer
15 years 6 months ago
2010
Springer
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
131
click to vote
FPL
2007
Springer
15 years 5 months ago
2007
Springer
Reconfiguration time in dynamically-reconfigurable modular systems can severely limit application run-time compared to the critical path delay. In this paper we present a novel ...
142
click to vote
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 ...
157
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
145
click to vote
ATMOS
2009
15 years 5 months ago
2009
Abstract. Computation of quickest paths has undergoing a rapid development in recent years. It turns out that many high-performance route planning algorithms are made up of several...