Fabrizio Luccio, Linda Pagli  Home/Search
Context
Related
| di.unipi.it/pub/techrep...TR0208.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: di.unipi.it/ricerca/TR/tr2002 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A k-dense tree, k integer 1, is a natural extension of a tree. A leaf is a vertex connected to the rest of the structure through k edges. After the removal of a leaf, the structure still has other leaves. Among other applications, dense trees can be used as interconnection structures in a network. Representing the network in connected graph form G = (V; E), we construct a k-dense tree T as a subgraph of G spanning all its vertices. T is then decomposed in k super-root spanning trees... (Update)
Active bibliography (related documents): More All
1.1: Some New Results for k-Dense Trees: NP-Completeness Theory - Franceschini (2001) (Correct)
1.1: Some New Results for k-Dense Trees: Graph Theory - Franceschini (2001) (Correct)
0.3: Masked Interval Routing: a New Routing Scheme - Luccio, Mahafzah, Omari, Pagli (1997) (Correct)
Similar documents based on text: More All
0.1: Revised version of "Efficient Cross-Trees for External Memory" - Grossi, Italiano (2000) (Correct)
0.1: Optimal Space-Time Dictionaries over an Unbounded Universe .. - Franceschini, Grossi (2003) (Correct)
0.0: Distributed Multi-Interface Computing with Polyglot - Todd, Glinert (Correct)
BibTeX entry: (Update)
@misc{ luccio-distributed,
author = "Fabrizio Luccio and Linda Pagli",
title = "Distributed Construction of Almost-Edge-Disjoint Spanning Trees via Dense
Trees",
url = "citeseer.ist.psu.edu/luccio02distributed.html" }
Citations (may not include all citations):718 Distributed Algorithms (context) - Lynch - 1996
572 Computers and Intractability (context) - Garey, Johnson - 1979
185 A sufficient condition for backtrack-free search (context) - Freuder - 1982
34 Distance labeling in graphs - Gavoille, Peleg et al. - 2001
23 Theoretical Computer Science (context) - Gavoille, on et al. - 2000
16 The multi-tree approach to reliability in distributed networ.. - Itai, Rodeh - 1988
10 small coalitions and controlling monopolies in graphs: A rev.. (context) - Peleg, voting - 1996
10 Labeling and Implicit Routing in Networks (context) - Santoro, Khatib - 1985
8 A min-max theorem for graphs with applications to graph colo.. (context) - Matula - 1968
4 On mixed connectivity certificates (context) - Even, Itkis et al. - 1998
3 Dense Trees: a New Structure for Interconnection (context) - Luccio, Pagli - 2000
3 Distributed Data and Structures (context) - Pacheco, Franceschini et al. - 2001
3 A distributed tree data structure (context) - Luccio, Mesa et al.
3 Interval Routing The Computer Journal (context) - van Leeuwen, Tan - 1987
1 International Congress on Computer Science Research (context) - Noval, Luccio et al.
1 ACM SIGACT News - Distributed Computing Column (context) - Routing, networks et al. - 2001
Documents on the same site (http://www.di.unipi.it/ricerca/TR/tr2002.html): More
π-Calculus Early Observational Equivalence: A First Order.. - Montanari (2002) (Correct)
Functorial Models for Contextual Pre-Nets - Bruni, Meseguer, Montanari.. (2002) (Correct)
Recovery Of Certain Displacement Matrices - Bozzo (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC