An NC parallel algorithm for generalized vertex-rankings of partial k-trees

M. A. Kashem, Xiao Zhou, T. Nishizeki

Research output: Contribution to conferencePaperpeer-review

1 Citation (Scopus)

Abstract

A c-vertex-ranking of a graph G for a positive integer c is a labeling of the vertices of G with integers such that, for any label i, deletion of all vertices with labels >i leaves connected components, each having at most c vertices with label i. We present a parallel algorithm to find a c-vertex-ranking of a partial k-tree using the minimum number of ranks. This is the first parallel algorithm for c-vertex-ranking of a partial k-tree G, and takes O(log n) time using a polynomial number of processors on the common CRCW PRAM for any positive integer c and any fixed integer k, where n is the number of vertices in G.

Original languageEnglish
Pages105-111
Number of pages7
DOIs
Publication statusPublished - 1997 Jan 1
Event3rd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 1997 - Taipei, Taiwan, Province of China
Duration: 1997 Dec 181997 Dec 20

Other

Other3rd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 1997
CountryTaiwan, Province of China
CityTaipei
Period97/12/1897/12/20

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Safety, Risk, Reliability and Quality

Fingerprint Dive into the research topics of 'An NC parallel algorithm for generalized vertex-rankings of partial k-trees'. Together they form a unique fingerprint.

Cite this