Sciweavers

376 search results - page 45 / 76
» Near-optimum Universal Graphs for Graphs with Bounded Degree...
Sort
View
ESA
2007
Springer
92views Algorithms» more  ESA 2007»
14 years 2 months ago
Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation
Abstract. The small world phenomenon, a.k.a. the six degree of separation between individuals, was identified by Stanley Milgram at the end of the 60s. Milgram experiment demonstr...
Pierre Fraigniaud
SIGMETRICS
2008
ACM
115views Hardware» more  SIGMETRICS 2008»
13 years 8 months ago
Densification arising from sampling fixed graphs
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
Pedram Pedarsani, Daniel R. Figueiredo, Matthias G...
SIROCCO
2007
13 years 10 months ago
Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs
The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...
Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis...
SIROCCO
2004
13 years 10 months ago
Path Layout on Tree Networks: Bounds in Different Label Switching Models
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
Anat Bremler-Barr, Leah Epstein
OA
1989
237views Algorithms» more  OA 1989»
14 years 21 days ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph