- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- 【Updated on June 30, 2025】Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
Algorithms for finding f-colorings of partial k-trees
Bibliographic Information
- Other Title
-
- An extended abstract
Description
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.