Sciweavers

632 search results - page 54 / 127
» On Routing in Circulant Graphs
Sort
View
CCR
2008
106views more  CCR 2008»
14 years 10 months ago
Message-efficient dissemination for loop-free centralized routing
With steady improvement in the reliability and performance of communication devices, routing instabilities now contribute to many of the remaining service degradations and interru...
Haldane Peterson, Soumya Sen, Jaideep Chandrasheka...
CN
2007
95views more  CN 2007»
14 years 10 months ago
Sampling large Internet topologies for simulation purposes
In this paper, we develop methods to ‘‘sample’’ a small realistic graph from a large Internet topology. Despite recent activity, modeling and generation of realistic graph...
Vaishnavi Krishnamurthy, Michalis Faloutsos, Marek...
ICALP
2007
Springer
15 years 4 months ago
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
Jiong Guo, Rolf Niedermeier
RANDOM
2001
Springer
15 years 2 months ago
Near-optimum Universal Graphs for Graphs with Bounded Degrees
d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raym...
Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakaw...
SIAMDM
2010
99views more  SIAMDM 2010»
14 years 4 months ago
On the Stable Paths Problem
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong