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 linear-time sequential algorithm and an optimal parallel algorithm which find an f-coloring of a givenpartial k-tree with the minimum number of colors.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. In Proc. of the 25th Ann. ACM Symp. on Theory of Computing, pp. 226–234, San Diego, CA, 1993.
R. B. Borie, R. G. Parker, and C. A. Tovey. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica, 7, pp. 555–581, 1992.
S. Fiorini and R. J. Wilson. Edge-Colourings of Graphs. Pitman, London, 1977.
A. Gibbons and W. Rytter. Efficient Parallel Algorithms. Cambridge Univ. Press, Cambridge, 1988.
S. L. Hakimi and O. Kariv. On a generalization of edge-coloring in graphs. Journal of Graph Theory, 10, pp. 139–154, 1986.
I. Holyer. The NP-completeness of edge-colouring. SIAM J. Comput., 10, pp. 718–720, 1981.
J. JáJá. An Introduction to Parallel Algorithms. Addison-Wesley, New York, 1992.
S. Nakano and T. Nishizeki. Scheduling file transfers under port and channel constraints. Int. J. Found. of Comput. Sci., 4(2), pp. 101–115, 1993.
T. Nishizeki and N. Chiba. Planar Graphs: Theory and Algorithms. North-Holland, Amsterdam, 1988.
B.A. Reed. Finding approximate separators and computing tree-width quickly. In Proc. of the 24th Ann. ACM Symp. on Theory of Computing, pp. 221–228, 1992.
V. G. Vizing. On an estimate of the chromatic class of a p-graph. Discret Analiz, 3, pp. 25–30, 1964.
X. Zhou, S. Nakano, and T. Nishizeki. A linear algorithm for edge-coloring partial k-trees. In Proc. of the First Europian Symposium on Algorithms, Lect. Notes in Computer Science, Springer-Verlag, 726, pp. 409–418, 1993.
X. Zhou, S. Nakano, and T. Nishizeki. A parallel algorithm for edge-coloring partial k-trees. In Proc. of the Fourth Scandinavian Workshop on Algorithm Theory, Lect. Notes in Computer Science, Springer-Verlag, 824, pp. 359–369, 1994.
X. Zhou and T. Nishizeki. Optimal parallel algorithms for edge-coloring partial k-trees with bounded degrees. IEICE Trans. on Fundamentals of Electronics, Communication and Computer Sciences, E78-A, pp. 463–469, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, X., Nishizeki, T. (1995). Algorithms for finding f-colorings of partial k-trees. In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds) Algorithms and Computations. ISAAC 1995. Lecture Notes in Computer Science, vol 1004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015439
Download citation
DOI: https://doi.org/10.1007/BFb0015439
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60573-7
Online ISBN: 978-3-540-47766-2
eBook Packages: Springer Book Archive