A Linear Time Algorithm for Finding a k -Tree Core

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.23, Iss.2, 1997-05, pp. : 281-290

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

A linear time algorithm to construct a tree 4-spanner on trapezoid graphs

By Barman Sambhu Charan

International Journal of Computer Mathematics, Vol. 87, Iss. 4, 2010-03 ,pp. : 743-755

Taylor & Francis Ltd

Access to resources Recommend Favorite

An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three

RANDOM STRUCTURES AND ALGORITHMS, Vol. 47, Iss. 1, 2015-08 ,pp. : 73-98

John Wiley & Sons Inc

Access to resources Recommend Favorite

Finding communities in linear time: a physics approach

By Wu F. Huberman B.

The European Physical Journal B - Condensed Matter, Vol. 38, Iss. 2, 2004-03 ,pp. : 331-338

Springer Publishing Company

Access to resources Recommend Favorite

A self-stabilizing graph algorithm: Finding the cutting center of a tree

By Chaudhuri P. Thompson H.

International Journal of Computer Mathematics, Vol. 81, Iss. 2, 2004-02 ,pp. : 183-190

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph

By Luczak T. Szymanska E.

Journal of Algorithms, Vol. 25, Iss. 2, 1997-11 ,pp. : 311-320

Academic Press

Access to resources Recommend Favorite