scientific article; zbMATH DE number 6258034

zbMath1289.94086MaRDI QIDQ5395638

Sándor Szabó

Publication date: 17 February 2014

Full work available at URL: http://ac.inf.elte.hu/Vol_041_2013/307_41.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

maximum clique problemset packing problemmonotonic matrixclique search algorithmsinteger code\(k\)-clique problempractical algorithms for NP-complete problemsTripod, semi-cross

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Other types of codes (94B60) Extremal combinatorics (05D99)

Related Items (9)

Reducing graph coloring to clique search ⋮ Metric space method for constructing splitting partitions of graphs ⋮ CliSAT: a new exact algorithm for hard maximum clique problems ⋮ New results on tripod packings ⋮ Speeding up Parallel Combinatorial Optimization Algorithms with Las Vegas Method ⋮ Estimating the fractional chromatic number of a graph ⋮ Decomposing clique search problems into smaller instances based on node and edge colorings ⋮ Estimating clique size by coloring the nodes of auxiliary graphs ⋮ Numerical experiments with LP formulations of the maximum clique problem

This page was built for publication: