Algorithm 88. A new algorithm calculating the distance between binary arborescences
Z. Palka (1983)
Applicationes Mathematicae
Similarity:
Z. Palka (1983)
Applicationes Mathematicae
Similarity:
G. Trybuś (1976)
Applicationes Mathematicae
Similarity:
Panholzer, Alois, Prodinger, Helmut (1997)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Janina Bazan (1977)
Applicationes Mathematicae
Similarity:
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Jaroslav Nešetřil (1997)
Archivum Mathematicum
Similarity:
On the background of Borůvka’s pioneering work we present a survey of the development related to the Minimum Spanning Tree Problem. We also complement the historical paper Graham-Hell [GH] by a few remarks and provide an update of the extensive literature devoted to this problem.
Paulden, Tim, Smith, David K. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Anna Kobusińska, Jerzy Brzeziński, Michał Boroń, Łukasz Inatlewski, Michał Jabczyński, Mateusz Maciejewski (2016)
International Journal of Applied Mathematics and Computer Science
Similarity:
Currently existing solutions rarely protect message integrity, authenticity and user anonymity without burdening the user with details of key management. To address this problem, we present Aldeon-a protocol for anonymous group conversations in a peer-to-peer system. The efficiency of Aldeon is based on a novel tree synchronization algorithm, which is proposed and discussed in this paper. By using this algorithm, a significant reduction in the number of exchanged messages is achieved....
R. Kemp (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Charalampos Papamanthou, Konstantinos Paparrizos, Nikolaos Samaras (2005)
The Yugoslav Journal of Operations Research
Similarity: