Lower Estimate of Clique Size via Edge Coloring
Mathematica Pannonica · 2021
DOI: 10.1556/314.2020.00002 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematica Pannonica, 2021. Verfasst von Balázs Király und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
In many clique search algorithms well coloring of the nodes is employed to find an upper bound of the clique number of the given graph. In an earlier work a non-traditional edge coloring scheme was proposed to get upper bounds that are typically better than the one provided by the well coloring of the nodes. In this paper we will show that the same scheme for well coloring of the edges can be used to find lower bounds for the clique number of the given graph. In order to assess the performance of the procedure we carried out numerical experiments.
Zitieren
APA
Király, B., & Szabó, S. (2021). Lower Estimate of Clique Size via Edge Coloring. Mathematica Pannonica. https://doi.org/10.1556/314.2020.00002
Vancouver
Király B, Szabó S. Lower Estimate of Clique Size via Edge Coloring. Mathematica Pannonica. 2021. doi:10.1556/314.2020.00002
BibTeX
@article{Kirly2021,
author = {Király, Balázs and Szabó, Sándor},
title = {Lower Estimate of Clique Size via Edge Coloring},
journal = {Mathematica Pannonica},
year = {2021},
doi = {10.1556/314.2020.00002}
}
EUVIMED