Linear Algorithm for Finding List Edge-Colorings of Series-Parallel Graphs (<Special Issue>Special Issue on Selected Papers from LA Symposium)
スポンサーリンク
概要
- 論文の詳細を見る
Assume that each edge c of a graph G is as-signed a list (set) L(e) of colors. Then an edge-coloring of G is called an L-edge-coloring if each edge c of G is colored with a color contained in L(e). It is known that any series-parallel simple graph G has an L-edge-coloring if either (i) |L(e)| ★ max{4,d(v),d(w)} for each edge e = vw or (ii) the maximum degree of G is at most three and |L(e)| ★ 3 for each edge c, where d(v) and d(w) are the degrees of the ends v and w of e, respectively. In this paper we give a linear-time algorithm for finding such an L-edge-coloring of a series-parallel graph G.
- 社団法人電子情報通信学会の論文
- 2003-02-01
著者
-
Nishizeki T
Tohoku Univ. Sendai Jpn
-
Nishizeki Takao
Tohoku Univ. Sendai‐shi Jpn
-
Nishizeki Takao
Graduate School Of Information Sciences Tohoku University
-
Zhou X
Tohoku Univ. Sendai‐shi Jpn
-
Zhou Xiao
Tohoku Univ. Sendai‐shi Jpn
-
Zhou Xiao
Graduate School Of Information Sciences Tohoku University
-
FUJINO Tomoya
Graduate School of Information Sciences. Tohoku University
-
ISOBE Shuji
Graduate School of Information Sciences, Tohoku University
-
Isobe S
Graduate School Of Information Sciences Tohoku University
-
Isobe Shuji
Graduate School Of Information Sciences Tohoku University
-
Nishizeki Takao
Graduate School Of Information Sciences
-
Fujino Tomoya
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)
- New Security Index for Digital Fingerprinting and Its Bounds
- Optimal Parallel Algorithms for Edge-Coloring Partial k-Trees with Bounded Degrees
- Efficient Compression of Web Graphs
- Generalized Edge-Rankings of Trees
- Bipartition of Biconnected Graphs
- Graph Coloring Algorithms(Special Issue on Algorithm Engineering : Surveys)
- 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
- The RSA Group Is Adaptive Pseudo-Free under the RSA Assumption