Algorithms for finding f-colorings of partial k-trees

Xiao Zhou; Takao Nishizeki

Algorithms for finding f-colorings of partial k-trees

Xiao Zhou, Takao Nishizeki

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

Abstract

In an ordinary edge-coloring of a graph G = (V, E) each color appears at each vertex v ϵ V at most once. An f-coloring is a generalized edge-coloring in which each color appears at each vertex v ϵ V at most f(v) times, where f(v) is a positive integer assigned to v. This paper gives a lineax-time sequential algorithm and an optimal parallel algorithm which find an f-coloring of a given-partial k-tree with the minimum number of colors.

Original language	English
Title of host publication	Algorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings
Editors	Alistair Moffat, John Staples, Naoki Katoh, Peter Eades
Publisher	Springer-Verlag
Pages	332-341
Number of pages	10
ISBN (Print)	3540605738, 9783540605737
Publication status	Published - 1995 Jan 1
Externally published	Yes
Event	6th International Symposium on Algorithms and Computations, ISAAC 1995 - Cairns, Australia Duration: 1995 Dec 4 → 1995 Dec 6

Publication series

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

Other

Other	6th International Symposium on Algorithms and Computations, ISAAC 1995
Country	Australia
City	Cairns
Period	95/12/4 → 95/12/6

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Fingerprint Dive into the research topics of 'Algorithms for finding f-colorings of partial k-trees'. Together they form a unique fingerprint.

Cite this

Zhou, X., & Nishizeki, T. (1995). Algorithms for finding f-colorings of partial k-trees. In A. Moffat, J. Staples, N. Katoh, & P. Eades (Eds.), Algorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings (pp. 332-341). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1004). Springer-Verlag.

Algorithms for finding f-colorings of partial k-trees. / Zhou, Xiao; Nishizeki, Takao.

Algorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings. ed. / Alistair Moffat; John Staples; Naoki Katoh; Peter Eades. Springer-Verlag, 1995. p. 332-341 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1004).

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

Zhou, X & Nishizeki, T 1995, Algorithms for finding f-colorings of partial k-trees. in A Moffat, J Staples, N Katoh & P Eades (eds), Algorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1004, Springer-Verlag, pp. 332-341, 6th International Symposium on Algorithms and Computations, ISAAC 1995, Cairns, Australia, 95/12/4.

Zhou X, Nishizeki T. Algorithms for finding f-colorings of partial k-trees. In Moffat A, Staples J, Katoh N, Eades P, editors, Algorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings. Springer-Verlag. 1995. p. 332-341. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

Zhou, Xiao ; Nishizeki, Takao. / Algorithms for finding f-colorings of partial k-trees. Algorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings. editor / Alistair Moffat ; John Staples ; Naoki Katoh ; Peter Eades. Springer-Verlag, 1995. pp. 332-341 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1a4fcc6fa9be454492d33b0406dc9d5a,

title = "Algorithms for finding f-colorings of partial k-trees",

abstract = "In an ordinary edge-coloring of a graph G = (V, E) each color appears at each vertex v ϵ V at most once. An f-coloring is a generalized edge-coloring in which each color appears at each vertex v ϵ V at most f(v) times, where f(v) is a positive integer assigned to v. This paper gives a lineax-time sequential algorithm and an optimal parallel algorithm which find an f-coloring of a given-partial k-tree with the minimum number of colors.",

author = "Xiao Zhou and Takao Nishizeki",

year = "1995",

month = jan,

day = "1",

language = "English",

isbn = "3540605738",

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

publisher = "Springer-Verlag",

pages = "332--341",

editor = "Alistair Moffat and John Staples and Naoki Katoh and Peter Eades",

booktitle = "Algorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings",

note = "6th International Symposium on Algorithms and Computations, ISAAC 1995 ; Conference date: 04-12-1995 Through 06-12-1995",

}

TY - GEN

T1 - Algorithms for finding f-colorings of partial k-trees

AU - Zhou, Xiao

AU - Nishizeki, Takao

PY - 1995/1/1

Y1 - 1995/1/1

N2 - In an ordinary edge-coloring of a graph G = (V, E) each color appears at each vertex v ϵ V at most once. An f-coloring is a generalized edge-coloring in which each color appears at each vertex v ϵ V at most f(v) times, where f(v) is a positive integer assigned to v. This paper gives a lineax-time sequential algorithm and an optimal parallel algorithm which find an f-coloring of a given-partial k-tree with the minimum number of colors.

AB - In an ordinary edge-coloring of a graph G = (V, E) each color appears at each vertex v ϵ V at most once. An f-coloring is a generalized edge-coloring in which each color appears at each vertex v ϵ V at most f(v) times, where f(v) is a positive integer assigned to v. This paper gives a lineax-time sequential algorithm and an optimal parallel algorithm which find an f-coloring of a given-partial k-tree with the minimum number of colors.

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

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

M3 - Conference contribution

AN - SCOPUS:21844487531

SN - 3540605738

SN - 9783540605737

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

SP - 332

EP - 341

BT - Algorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings

A2 - Moffat, Alistair

A2 - Staples, John

A2 - Katoh, Naoki

A2 - Eades, Peter

PB - Springer-Verlag

T2 - 6th International Symposium on Algorithms and Computations, ISAAC 1995

Y2 - 4 December 1995 through 6 December 1995

ER -

Algorithms for finding f-colorings of partial k-trees

Abstract

Publication series

Other

ASJC Scopus subject areas

Other files and links

Cite this