Fast algorithms for edge coloring in clustered hypergraphs: A study of computational efficiency

Wasan Mustafa Jawad ()

Edelweiss Applied Science and Technology, 2024, vol. 8, issue 6, 9438-9449

Abstract: The generalization of edge coloring in hypergraphs, especially clustered ones, remains an open problem due to the intricate structure and organization of hyper-edges grouped in clusters. This study addresses the computational challenges associated with edge coloring in clustered hypergraphs by introducing a novel suite of fast algorithms specifically designed to achieve improved accuracy and computation time. The algorithms utilize structural properties such as hypergraph Laplacian spectral features and submodular optimization to enhance efficiency. Experimental results demonstrate a 10-15% improvement in clustering accuracy and a 20% reduction in computational time compared to baseline methods, validating the approach for both synthetic and real-world datasets. These findings contribute to hypergraph theory and propose a practical solution for applications in network layout, parallel computing frameworks, and data organization. Future work could further optimize these algorithms for large-scale real-time applications.

Keywords: Algorithm design; Clustered hypergraphs; Computational efficiency; Edge coloring; Hypergraph theory. (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
https://learning-gate.com/index.php/2576-8484/article/view/4020/1527 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ajp:edwast:v:8:y:2024:i:6:p:9438-9449:id:4020

Access Statistics for this article

More articles in Edelweiss Applied Science and Technology from Learning Gate
Bibliographic data for series maintained by Melissa Fernandes ().