Results 1  10
of
80,201
Spanners for bounded treelength graphs
, 2007
"... This paper concerns construction of additive stretched spanners with few edges for nvertex graphs having a treedecomposition into bags of diameter at most δ, i.e., the treelength δ graphs. For such graphs we construct additive 2δspanners with O(δn+n log n) edges, and additive 4δspanners with O( ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(δn) edges. This provides new upper bounds for chordal graphs for which δ = 1. We also show a lower bound, and prove that there are graphs of treelength δ for which every multiplicative δspanner (and thus every additive (δ − 1)spanner) requires Ω(n 1+1/Θ(δ) ) edges.
Additive spanners for kchordal graphs
 In 5 th Italian Conference on Algorithms and Complexity (CIAC), volume 2653 of LNCS
, 2003
"... Abstract. In this paper we show that every chordal graph with n vertices and m edges admits an additive 4spanner with at most 2n−2 edges and an additive 3spanner with at most O(n · log n) edges. This significantly improves results of Peleg and Schäffer from [Graph Spanners, J. Graph Theory, 13(198 ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
(1989), 99116]. Our spanners are additive and easier to construct. An additive 4spanner can be constructed in linear time while an additive 3spanner is constructable in O(m · log n) time. Furthermore, our method can be extended to graphs with largest induced cycles of length k. Any such graph admits
Sparse Additive Spanners for Bounded TreeLength Graphs
 IN 11TH INTERNATIONAL COLLOQUIUM ON STRUCTURAL INFORMATION & COMMUNICATION COMPLEXITY (SIROCCO
, 2004
"... This paper concerns construction of additive stretched spanners with few edges for nvertex graphs having a treedecomposition into bags of diameter at most , i.e., the treelength graphs. For such graphs we construct additive 2spanners with O(n log n) edges, and additive 6spanners with O(n) e ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(n) edges. We also show a lower bound, and prove that there are graphs of treelength for which every multiplicative spanner (and thus every additive ( 1)spanner) requires 1+1=() ) edges.
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Compact Routing Schemes for Generalised Chordal Graphs
, 2004
"... In this paper, we show how to use the notion of layeringtree introduced in [5], in order to obtain polynomial time constructible routing schemes. We describe efficient routing schemes for two classes of graphs that include the class of chordal graphs. For kchordal graphs, i.e., graphs containing n ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this paper, we show how to use the notion of layeringtree introduced in [5], in order to obtain polynomial time constructible routing schemes. We describe efficient routing schemes for two classes of graphs that include the class of chordal graphs. For kchordal graphs, i.e., graphs containing
Orthonormal bases of compactly supported wavelets
, 1993
"... Several variations are given on the construction of orthonormal bases of wavelets with compact support. They have, respectively, more symmetry, more regularity, or more vanishing moments for the scaling function than the examples constructed in Daubechies [Comm. Pure Appl. Math., 41 (1988), pp. 90 ..."
Abstract

Cited by 2182 (27 self)
 Add to MetaCart
Several variations are given on the construction of orthonormal bases of wavelets with compact support. They have, respectively, more symmetry, more regularity, or more vanishing moments for the scaling function than the examples constructed in Daubechies [Comm. Pure Appl. Math., 41 (1988), pp
An Architecture for WideArea Multicast Routing
"... Existing multicast routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. When group members, and senders to those group members, are distributed sparsely across a wide area, these schemes are not efficient; data packets or ..."
Abstract

Cited by 529 (22 self)
 Add to MetaCart
Existing multicast routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. When group members, and senders to those group members, are distributed sparsely across a wide area, these schemes are not efficient; data packets
A Partial KArboretum of Graphs With Bounded Treewidth
 J. Algorithms
, 1998
"... The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be seen to have a uniform upper bound on the treewidth of graphs in the class. Also, some mutual relations between such classes ..."
Abstract

Cited by 328 (34 self)
 Add to MetaCart
The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be seen to have a uniform upper bound on the treewidth of graphs in the class. Also, some mutual relations between
Results 1  10
of
80,201