Generalized vertex-rankings of partial k-trees

Md Abul Kashem; Xiao Zhou; Takao Nishizeki

Generalized vertex-rankings of partial k-trees

Md Abul Kashem, Xiao Zhou, Takao Nishizeki

INF - System Information Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (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 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 language	English
Title of host publication	Computing and Combinatorics - 3rd Annual International Conference COCOON 1997, Proceedings
Editors	Tao Jiang, D.T. Lee
Publisher	Springer-Verlag
Pages	212-221
Number of pages	10
ISBN (Print)	354063357X, 9783540633570
Publication status	Published - 1997 Jan 1
Event	3rd Annual International Computing and Combinatorics Conference, COCOON 1997 - Shanghai, China Duration: 1997 Aug 20 → 1997 Aug 22

Publication series

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

Other

Other	3rd Annual International Computing and Combinatorics Conference, COCOON 1997
Country	China
City	Shanghai
Period	97/8/20 → 97/8/22

Keywords

Algorithm
Partial k-tree
Separator tree
Treewidth
Vertexranking

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

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

Cite this

Kashem, M. A., Zhou, X., & Nishizeki, T. (1997). Generalized vertex-rankings of partial k-trees. In T. Jiang, & D. T. Lee (Eds.), Computing and Combinatorics - 3rd Annual International Conference COCOON 1997, Proceedings (pp. 212-221). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1276). Springer-Verlag.

Generalized vertex-rankings of partial k-trees. / Kashem, Md Abul; Zhou, Xiao; Nishizeki, Takao.

Computing and Combinatorics - 3rd Annual International Conference COCOON 1997, Proceedings. ed. / Tao Jiang; D.T. Lee. Springer-Verlag, 1997. p. 212-221 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1276).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Kashem, MA, Zhou, X & Nishizeki, T 1997, Generalized vertex-rankings of partial k-trees. in T Jiang & DT Lee (eds), Computing and Combinatorics - 3rd Annual International Conference COCOON 1997, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1276, Springer-Verlag, pp. 212-221, 3rd Annual International Computing and Combinatorics Conference, COCOON 1997, Shanghai, China, 97/8/20.

Kashem MA, Zhou X, Nishizeki T. Generalized vertex-rankings of partial k-trees. In Jiang T, Lee DT, editors, Computing and Combinatorics - 3rd Annual International Conference COCOON 1997, Proceedings. Springer-Verlag. 1997. p. 212-221. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

Kashem, Md Abul ; Zhou, Xiao ; Nishizeki, Takao. / Generalized vertex-rankings of partial k-trees. Computing and Combinatorics - 3rd Annual International Conference COCOON 1997, Proceedings. editor / Tao Jiang ; D.T. Lee. Springer-Verlag, 1997. pp. 212-221 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

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

}

TY - GEN

T1 - Generalized vertex-rankings of partial k-trees

AU - Kashem, Md Abul

AU - Zhou, Xiao

AU - Nishizeki, Takao

PY - 1997/1/1

Y1 - 1997/1/1

N2 - 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.

AB - 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.

KW - Algorithm

KW - Partial k-tree

KW - Separator tree

KW - Treewidth

KW - Vertexranking

UR - http://www.scopus.com/inward/record.url?scp=0347475585&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0347475585&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0347475585

SN - 354063357X

SN - 9783540633570

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 212

EP - 221

BT - Computing and Combinatorics - 3rd Annual International Conference COCOON 1997, Proceedings

A2 - Jiang, Tao

A2 - Lee, D.T.

PB - Springer-Verlag

T2 - 3rd Annual International Computing and Combinatorics Conference, COCOON 1997

Y2 - 20 August 1997 through 22 August 1997

ER -