3 search results - page 1 / 1 » A Symbolic Approach to the All-Pairs Shortest-Paths Problem |
WG
2004
Springer
13 years 10 months ago
2004
Springer
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
BMCBI
2008
13 years 5 months ago
2008
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...