A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of Combinatorial Optimization Ročník 25; s. 430 - 459
Hlavní autori:	Kamei, Sayaka, Kakugawa, Hirostugu, Devismes, Stéphane, Tixeuil, Sébastien
Médium:	Journal Article
Jazyk:	Japanese
Vydavateľské údaje:	Springer Berlin Heidelberg 01.01.2010
Predmet:	[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC] [INFO.INFO-DC]Computer Science [cs]/Distributed [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC] [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS] [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI] [INFO]Computer Science [cs] and Cluster Computing [cs.DC] Applied Mathematics Approximation Computational Theory and Mathematics Computer Science Applications Control and Optimization Discrete Mathematics and Combinatorics Fault-tolerance Maximum leaf spanning tree Parallel Self-stabilization
ISSN:	1382-6905, 1573-2886
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
ISSN:	1382-6905 1573-2886
DOI:	10.1007/978-3-642-14031-0_11