Algorithms for finding f-colorings of partial k-trees

Xiao Zhou, Takao Nishizeki

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

4 Citations (Scopus)

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 languageEnglish
Title of host publicationAlgorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings
EditorsAlistair Moffat, John Staples, Naoki Katoh, Peter Eades
PublisherSpringer-Verlag
Pages332-341
Number of pages10
ISBN (Print)3540605738, 9783540605737
Publication statusPublished - 1995 Jan 1
Externally publishedYes
Event6th International Symposium on Algorithms and Computations, ISAAC 1995 - Cairns, Australia
Duration: 1995 Dec 41995 Dec 6

Publication series

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

Other

Other6th International Symposium on Algorithms and Computations, ISAAC 1995
CountryAustralia
CityCairns
Period95/12/495/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