Finding Uncomplemented Trees

Publisher： John Wiley & Sons Inc

E-ISSN： 1467-9590|51|3|309-310

ISSN： 0022-2526

Source： STUDIES IN APPLIED MATHEMATICS, Vol.51, Iss.3, 1972-09, pp. : 309-310

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

Finding Uncomplemented Trees

By  

STUDIES IN APPLIED MATHEMATICS, Vol. 22-2526, Iss. 3, 1972-09 ,pp. : 309-310

John Wiley & Sons Inc

Access to resources Recommend Favorite

Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees

By Alstrup S.   Thorup M.  

Journal of Algorithms, Vol. 35, Iss. 2, 2000-05 ,pp. : 169-188

Academic Press

Access to resources Recommend Favorite

A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees

By Fekete S.P.   Khuller S.   Klemmstein M.   Raghavachari B.   Young N.  

Journal of Algorithms, Vol. 24, Iss. 2, 1997-08 ,pp. : 310-324

Academic Press

Access to resources Recommend Favorite

Using a Conic Formulation for Finding Steiner Minimal Trees: Theory and Practice in Optimization. Guest Editors: José Mario Martínez and Jin Yun Yuan

By Fampa Marcia   Maculan Nelson  

Numerical Algorithms, Vol. 35, Iss. 2-4, 2004-04 ,pp. : 315-330

Springer Publishing Company

Access to resources Recommend Favorite

On random trees

By Móri T.  

Studia Scientiarum Mathematicarum Hungarica, Vol. 39, Iss. 1-2, 2002-12 ,pp. : 143-155

Akademiai Kiado

Access to resources Recommend Favorite