Sciweavers

721 search results - page 53 / 145
» Almost universal graphs
Sort
View
COMPLEX
2009
Springer
15 years 10 months ago
Capturing Internet Traffic Dynamics through Graph Distances
Studies of the Internet have typically focused either on the routing system, i.e. the paths chosen to reach a given destination, or on the evolution of traffic on a physical link. ...
Steve Uhlig, Bingjie Fu, Almerima Jamakovic
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
15 years 8 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos
GLOBECOM
2010
IEEE
15 years 3 months ago
Circulant-Graph-Based Fault-Tolerant Routing for All-Optical WDM LANs
High demands in data delivery latency and communication reliability encourage the use of fault-toleranceenhanced all-optical WDM networks. Low latency is satisfied by setting up a ...
Dexiang Wang, Janise McNair
INFOVIS
2005
IEEE
15 years 11 months ago
Dynamic Visualization of Graphs with Extended Labels
The paper describes a novel technique to visualize graphs with extended node and link labels. The lengths of these labels range from a short phrase to a full sentence to an entire...
Pak Chung Wong, Patrick Mackey, Ken Perrine, James...
OOPSLA
2000
Springer
15 years 9 months ago
Scalable propagation-based call graph construction algorithms
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
Frank Tip, Jens Palsberg