Luccio F., Mesa A. and Pagli L., A distributed tree data structure, Proc. 1-st Internat. Symp. on Advanced Distributed Systems (ISADS2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Some New Results for k-Dense Trees: Graph Theory - Franceschini (2001) (Correct)
.... some properties of 2 dense trees, algorithm of construction (if it exists) of a spanning complete 2 dense tree for a generic graph, approximate algorithm of construction of a spanning 2 dense tree with the maximum number of edge for a generic graph, The second work about k dense trees is [LMP00]. In that paper a distributed data structure called Dense Search Tree was introduced (DST for short) A DST is constructed from a graph consisting of k identical binary trees: for any two not adjacent vertices, an edge is added between them if and only if the two vertices are contained in two ....
Fabrizio Luccio, Antonio Mesa, e Linda Pagli. A distributed tree data structure. Proceedings ISADS, 2000.
Distributed Construction of Almost-Edge-Disjoint Spanning.. - Luccio, Pagli (2002) (Correct)
No context found.
Luccio F., Mesa A. and Pagli L., A distributed tree data structure, Proc. 1-st Internat. Symp. on Advanced Distributed Systems (ISADS2000.
Some New Results for k-Dense Trees: NP-Completeness Theory - Franceschini (2001) (Correct)
No context found.
Fabrizio Luccio, Antonio Mesa, e Linda Pagli. A distributed tree data structure. Proceedings ISADS, 2000.
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