Work

A clique size estimate based on coloring the nodes of certain subgraphs

Year: 2018

Type: article

Abstract: Many of the maximum clique search algorithms used in practice employ a routine to establish upper estimate of the clique size of a given graph.The upper estimates are typically based on legally coloring the nodes in some greedy manner.Motivated by these facts we propose a upper estimate for the clique number.Using any greedy coloring procedure the nodes of many subgraphs are colored legally and then these partial results are combined together to a clique size upper estimate.

Source: Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae Sectio computatorica

DOI: 10.71352/ac.48.199

Author: Sándor Szabó

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W4409893992

FWCI:

Cites:

Cited by:

Related to: 10