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

ISSN： 0196-6774

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

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 for the Minimum-weight Feedback Vertex Set Problem in Series-parallel Graphs

By Zhang Shao-qiang Li Guo-jun Li Shu-guang

Acta Mathematicae Applicatae Sinica, Vol. 20, Iss. 4, 2004-11 ,pp. : 579-588

Springer Publishing Company

Access to resources Recommend Favorite

A Linear Time Algorithm for Finding a k -Tree Core

By Shioura A. Uno T.

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

Academic Press

Access to resources Recommend Favorite

A Randomized Parallel Algorithm for Planar Graph Isomorphism

By Gazit H. Reif J.H.

Journal of Algorithms, Vol. 28, Iss. 2, 1998-08 ,pp. : 290-314

Academic Press

Access to resources Recommend Favorite

A Randomized Parallel Algorithm for Single-Source Shortest Paths

By Klein P.N. Subramanian S.

Journal of Algorithms, Vol. 25, Iss. 2, 1997-11 ,pp. : 205-220

Academic Press

Access to resources Recommend Favorite

Configurations containing a given linear hypergraph

JOURNAL OF GRAPH THEORY, Vol. 87, Iss. 3, 2018-03 ,pp. : 356-361

John Wiley & Sons Inc

Access to resources Recommend Favorite