@inproceedings{97c5570deaf74d2e975089838a53fc2f,

title = "Generalized vertex-rankings of partial k-trees",

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 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.",

keywords = "Algorithm, Partial k-tree, Separator tree, Treewidth, Vertexranking",

author = "Kashem, {Md Abul} and Xiao Zhou and Takao Nishizeki",

year = "1997",

month = jan,

day = "1",

language = "English",

isbn = "354063357X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "212--221",

editor = "Tao Jiang and D.T. Lee",

booktitle = "Computing and Combinatorics - 3rd Annual International Conference COCOON 1997, Proceedings",

note = "3rd Annual International Computing and Combinatorics Conference, COCOON 1997 ; Conference date: 20-08-1997 Through 22-08-1997",

}