Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures

Author： Nardelli Enrico   Proietti Guido   Widmayer Peter  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.40, Iss.2, 2004-07, pp. : 119-132

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Linear-time algorithms for parametric minimum spanning tree problems on planar graphs

By Fernandez-Baca D.   Slutzki G.  

Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. : 57-74

Elsevier

Access to resources Recommend Favorite

A linear-time optimal-message distributed algorithm for minimum spanning trees

By Faloutsos Michalis   Molle Mart  

Distributed Computing, Vol. 17, Iss. 2, 2004-08 ,pp. : 151-170

Springer Publishing Company

Access to resources Recommend Favorite

On the Euclidean Minimum Spanning Tree Problem

By Rajasekaran Sanguthevar  

Computing Letters, Vol. 1, Iss. 1, 2005-01 ,pp. : 11-14

VSP

Access to resources Recommend Favorite

The Stackelberg Minimum Spanning Tree Game

By Cardinal Jean   Demaine Erik   Fiorini Samuel   Joret Gwenaël   Langerman Stefan   Newman Ilan   Weimann Oren  

Algorithmica, Vol. 59, Iss. 2, 2011-02 ,pp. : 129-144

Springer Publishing Company

Access to resources Recommend Favorite

The Complexity of Minimum Ratio Spanning Tree Problems

By Skiścim Christopher   Palocsay Susan  

Journal of Global Optimization, Vol. 30, Iss. 4, 2004-12 ,pp. : 335-346

Springer Publishing Company

Access to resources Recommend Favorite