类 型
7 篇文献
 
Collective Tree 1-Spanners for Interval Graphs  
Abstract. In this paper we study the existence of a small set T of spanning trees that collectively “1-span ” an interval graph G. Inparticular, for any pair of vertices u, v we require a tree T ∈T su......
Workshop on Graph-Theoretic Concepts in Computer Science  2005
4次引用 0 0
Additive Spanners for Circle Graphs and Polygonal Graphs  
A graph G =(V, E) is said to admit a system of μ collective additive tree r-spanners if there is a system T (G) of at most μ spanning trees of G such that for any two vertices u, v of G a spanning tre......
Workshop on Graph-Theoretic Concepts in Computer Science  2008
0次引用 0 0
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs  
Abstract. In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can assign each vertex ......
Workshop on Algorithms and Data Structures  2009
1次引用 0 0
I.: Collective tree spanners of graphs  
Abstract. In this paper we introduce a new notion of collective tree spanners. We say that a graph G =(V,E) admits a system of µ collective additive tree r-spanners if there is a system T (G) of at mo......
Siam Journal on Discrete Mathematics  2006
18次引用 0 0
Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width  
In this paper we study collective additive tree spanners for special families of graphs including planar graphs, graphs with bounded genus, graphs with bounded tree-width, graphs with bounded clique- ......
International Symposium on Algorithms and Computation  2005
2次引用 0 0
Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes  
Distance labelings and compact routing schemes have both been active areas of recent research. It was already known that graphs with constant-sized recursive separators, such as trees, outerplanar gra......
Workshop on Distributed Algorithms/International Symposium on Distributed Computing  2006
0次引用 0 0
Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs  
δ-Hyperbolic metric spaces have been defined by M. Gromov in 1987 via a simple 4-point condition: for any four points u, v, w, x, the two larger of the distance sums d(u, v) + d(w, x), d(u, w) + d(v, ......
Algorithmica  2012
2次引用 0 0

Feedback
Feedback
Feedback
我想反馈:
排行榜