Maximum packing for k-connected partial k-trees in polynomial time

By Dessmark A.   Lingas A.   Proskurowski A.  

Theoretical Computer Science, Vol. 236, Iss. 1, 2000-04 ,pp. : 179-191

Elsevier

Access to resources Recommend Favorite

An O(n) time hierarchical tree algorithm for computing force field in n-body simulations

By Guoliang X.  

Theoretical Computer Science, Vol. 197, Iss. 1, 1998-05 ,pp. : 157-169

Elsevier

Access to resources Recommend Favorite

TAL Recognition in O(M(n2)) Time

By Rajasekaran S.   Yooseph S.  

Journal of Computer and System Sciences, Vol. 56, Iss. 1, 1998-02 ,pp. : 83-89

Academic Press

Access to resources Recommend Favorite

On the approximability of some Maximum Spanning Tree Problems

By Galbiati G.   Morzenti A.   Maffioli F.  

Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. : 107-118

Elsevier

Access to resources Recommend Favorite

On-Line Construction of Two-Dimensional Suffix Trees in O(n² log n) Time

By Na Joong Chae   Giancarlo Raffaele   Park Kunsoo  

Algorithmica, Vol. 48, Iss. 2, 2007-06 ,pp. : 173-186

Springer Publishing Company

Access to resources Recommend Favorite