Sciweavers

177 search results - page 35 / 36
» Link Distance and Shortest Path Problems in the Plane
Sort
View
SSD
2005
Springer
145views Database» more  SSD 2005»
13 years 11 months ago
High Performance Multimodal Networks
Networks often form the core of many users’ spatial databases. Networks are used to support the rapid navigation and analysis of linearly connected data such as that found in tra...
Erik G. Hoel, Wee-Liang Heng, Dale Honeycutt
ICALP
2010
Springer
13 years 10 months ago
Additive Spanners in Nearly Quadratic Time
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
David P. Woodruff
BMCBI
2008
96views more  BMCBI 2008»
13 years 5 months ago
Novel methodology for construction and pruning of quasi-median networks
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...
Sarah C. Ayling, Terence A. Brown
GLOBECOM
2007
IEEE
13 years 9 months ago
S-OSPF: A Traffic Engineering Solution for OSPF Based Best Effort Networks
Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocol. It is well known that OSPF protocol does not provide flexibility in terms of packet fo...
Aditya Kumar Mishra, Anirudha Sahoo
PAM
2005
Springer
13 years 11 months ago
Internet Routing Policies and Round-Trip-Times
Abstract. Round trip times (RTTs) play an important role in Internet measurements. In this paper, we explore some of the ways in which routing policies impact RTTs. In particular, ...
Han Zheng, Eng Keong Lua, Marcelo Pias, Timothy G....