A linear-time algorithm for the strong chromatic index of Halin graphs
Ton Kloks, Yue-Li Wang
TL;DR
This paper presents a linear-time algorithm specifically designed to compute the strong chromatic index of Halin graphs, improving efficiency in graph coloring problems.
Contribution
The paper introduces the first linear-time algorithm for determining the strong chromatic index of Halin graphs, a significant advancement in graph theory algorithms.
Findings
Algorithm operates in linear time
Efficient computation of strong chromatic index for Halin graphs
Improves upon previous methods with higher complexity
Abstract
We show that there exists a linear-time algorithm that computes the strong chromatic index of Halin graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · graph theory and CDMA systems