Improving spanning trees by upgrading nodes

Author： Krumke S.O.   Noltemeier H.   Wirth H.-C.   Marathe M.V.   Ravi R.   Ravi S.S.   Sundaram R.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.221, Iss.1, 1999-06, pp. : 139-155

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

Abstract

Related content

Optimal Independent Spanning Trees on Odd Graphs

By Kim Jong-Seok   Lee Hyeong-Ok   Cheng Eddie   Lipták László  

The Journal of Supercomputing, Vol. 56, Iss. 2, 2011-05 ,pp. : 212-225

Springer Publishing Company

Access to resources Recommend Favorite

Minimum spanning trees in networks with varying edge weights

By Hutson Kevin   Shier Douglas  

Annals of Operations Research, Vol. 146, Iss. 1, 2006-09 ,pp. : 3-18

Springer Publishing Company

Access to resources Recommend Favorite

How to Use Spanning Trees to Navigate in Graphs

By Dragan Feodor   Xiang Yang  

Algorithmica, Vol. 66, Iss. 3, 2013-07 ,pp. : 479-511

Springer Publishing Company

Access to resources Recommend Favorite

Non-uniform random spanning trees on weighted graphs

By Mosbah M.   Saheb N.  

Theoretical Computer Science, Vol. 218, Iss. 2, 1999-05 ,pp. : 263-271

Elsevier

Access to resources Recommend Favorite

Fixed topology Steiner trees and spanning forests

By Lusheng W.   Xiaohua J.  

Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. : 359-370

Elsevier

Access to resources Recommend Favorite