Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs
type: Item
instance of: scholarly article
title: Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs
zbMATH Open document ID: 1303.05184
author: Austin Buchanan
author: Jose L. Walteros
author: Panos M. Pardalos
author: Sergiy Butenko
published in: Optimization Letters
publication date: 2014-12-05T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6377191
zbMATH Keywords: maximum clique
zbMATH Keywords: degeneracy
zbMATH Keywords: sparse graphs
zbMATH Keywords: fixed-parameter
zbMATH Keywords: tractability
zbMATH Keywords: \(d\)-degenerate graphs
describes a project that uses: Algorithm 457
MaRDI profile type: Publication
full work available at URL: s11590-013-0698-2
OpenAlex ID: W80045804
cites work: Graph Partitioning and Graph Clustering
cites work: Number of cliques in random scale-free network ensembles
cites work: Q3145799
cites work: Fast algorithms for max independent set
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: Q5747946
cites work: Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
cites work: k-Degenerate Graphs
cites work: Smallest-last ordering and clustering and graph coloring algorithms
DOI: 10.1007/S11590-013-0698-2
Recommended article: A new decomposition technique for maximal clique enumeration for sparse graphs
Recommended article: A new exact maximum clique algorithm for large and massive sparse graphs
Recommended article: A linear time algorithm for maximal clique enumeration in large sparse graphs
Recommended article: Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
Recommended article: Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
Recommended article: Fast maximal cliques enumeration in sparse graphs
Recommended article: Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
Recommended article: On CLIQUE Problem for Sparse Graphs of Large Dimension
Recommended article: A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
Recommended article: Q5111887
description: scientific article; zbMATH DE number 6377191