Generalized vertex-rankings of partial k-trees

Md Abul Kashem, Xiao Zhou, Takao Nishizeki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)


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 polynomial-time algorithm to find a c-vertex-ranking of a partial k-tree using the minimum number of ranks for any bounded integers c and k.

Original languageEnglish
Title of host publicationComputing and Combinatorics - 3rd Annual International Conference COCOON 1997, Proceedings
EditorsTao Jiang, D.T. Lee
PublisherSpringer Verlag
Number of pages10
ISBN (Print)354063357X, 9783540633570
Publication statusPublished - 1997
Externally publishedYes
Event3rd Annual International Computing and Combinatorics Conference, COCOON 1997 - Shanghai, China
Duration: 1997 Aug 201997 Aug 22

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other3rd Annual International Computing and Combinatorics Conference, COCOON 1997


  • Algorithm
  • Partial k-tree
  • Separator tree
  • Treewidth
  • Vertexranking

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Generalized vertex-rankings of partial k-trees'. Together they form a unique fingerprint.

Cite this