Cost Total Colorings of Trees(<Special Section>Foundations of Computer Science)
スポンサーリンク
概要
- 論文の詳細を見る
A total coloring of a graph G is to color all vertices and edges of G so that no two adjacent or incident elements receive the same color. Let C be a set of colors, and let ω be a cost function which assigns to each color c in C a real number ω(c) as a cost of c. A total coloring f of G is called an optimal total coloring if the sum of costs ω(f(x)) of colors f(x) assigned to all vertices and edges x is as small as possible. In this paper, we give an algorithm to find an optimal total coloring of any tree T in time O(nΔ^3) where n is the number of vertices in T and A is the maximum degree of T.
- 社団法人電子情報通信学会の論文
- 2004-02-01
著者
-
Nishizeki Takao
Graduate School Of Information Sciences Tohoku University
-
Zhou Xiao
Graduate School Of Information Sciences Tohoku University
-
Nishizeki Takao
Graduate School Of Information Sciences
-
KOBE Shuji
Graduate School of Information Sciences, Tohoku University
-
Kobe Shuji
Graduate School Of Information Sciences Tohoku University
-
Zhou Xiao
Graduate School Of Information Sciences Tohoku Univ.
関連論文
- List Edge-Colorings of Series-Parallel Graphs
- Linear Algorithm for Finding List Edge-Colorings of Series-Parallel Graphs (Special Issue on Selected Papers from LA Symposium)
- Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings
- Quantum Card Dealing
- Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups(Special Issue on Selected Papers from LA Symposium)
- Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs(Discrete Mathematics and Its Applications)
- Algorithms for Drawing Plane Graphs(Foundations of Computer Science)
- 平面グラフの格子短形描画
- On the One-Way Algebraic Homomorphism (Special Section on Cryprography and Information Security)
- Cost Total Colorings of Trees(Foundations of Computer Science)
- LA-10 A Linear Algorithm for Rectangular Drawings of Planar Graphs
- LA-9 Rectangle-of-Influence Drawings of Four-Connected Plane Graphs
- Edge-Coloring Problems for Graphs
- Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework(Data Mining)
- Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size(Graph Algorithms,Foundations of Computer Science)
- Algorithms for Multicolorings of Partial ★-Trees (Special Issue on Selected Papers from LA Symposium)
- Convex Drawings of Internally Triconnected Plane Graphs on O(n^2) Grids
- Best Security Index for Digital Fingerprinting(Information Hiding, Cryptography and Information Security)
- Efficient Compression of Web Graphs
- Generalized Edge-Rankings of Trees
- One-Way Functions over Finite Near-Rings
- An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree
- Energy-Efficient Threshold Circuits for Comparison Functions