Decomposing clique search problems into smaller instances based on node and edge colorings
type: Item
instance of: scholarly article
title: Decomposing clique search problems into smaller instances based on node and edge colorings
zbMATH Open document ID: 1384.05127
author: Sándor Szabó
author: Bogdán Zaválnij
published in: Discrete Applied Mathematics
publication date: 2018-04-20T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6862775
zbMATH Keywords: \(k\)-clique
zbMATH Keywords: maximum clique
zbMATH Keywords: clique search algorithm
zbMATH Keywords: independent set
zbMATH Keywords: branch and bound
zbMATH Keywords: node coloring
zbMATH Keywords: edge coloring
zbMATH Keywords: greedy coloring
zbMATH Keywords: combinatorial optimization
describes a project that uses: OEIS
MaRDI profile type: Publication
full work available at URL: j.dam.2018.01.006
OpenAlex ID: W2790406481
cites work: Finding a Maximum Clique in an Arbitrary Graph
cites work: Q3145799
cites work: New methods to color the vertices of a graph
cites work: An exact algorithm for the maximum clique problem
cites work: Test case generators and computational results for the maximum clique problem
cites work: Reducibility among Combinatorial Problems
cites work: Sur le coloriage des graphs
cites work: A fast algorithm for the maximum clique problem
cites work: Q4298260
cites work: Q5395638
cites work: Greedy algorithms for triangle free coloring
cites work: Speeding up Parallel Combinatorial Optimization Algorithms with Las Vegas Method
DOI: 10.1016/J.DAM.2018.01.006
description: scientific article; zbMATH DE number 6862775