Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
type: Item
instance of: scholarly article
title: Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
zbMATH Open document ID: 1276.90080
author: Svyatoslav Trukhanov
author: Chitra Balasubramaniam
author: B. Balasundaram
author: Sergiy Butenko
published in: Computational Optimization and Applications
publication date: 2013-08-26T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6201597
zbMATH Keywords: Russian doll search
zbMATH Keywords: clique relaxations
zbMATH Keywords: \(s\)-plex
zbMATH Keywords: \(s\)-defective clique
describes a project that uses: DIMACS
describes a project that uses: Algorithm 457
MaRDI profile type: Publication
full work available at URL: s10589-013-9548-5
OpenAlex ID: W2005863517
cites work: Q4945528
cites work: Finding maximum cliques in arbitrary and in special graphs
cites work: Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
cites work: Finding a Maximum Clique in an Arbitrary Graph
cites work: Russian doll search for the Steiner triple covering problem
cites work: Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
cites work: Novel approaches for analyzing biological networks
cites work: Mining market data: a network approach
cites work: Q3145799
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: A new table of constant weight codes
cites work: Clique-detection models in computational biochemistry and genomics
cites work: An exact algorithm for the maximum clique problem
cites work: Defective coloring revisited
cites work: Test case generators and computational results for the maximum clique problem
cites work: Q3139747
cites work: Q4198056
cites work: Clique is hard to approximate within \(n^{1-\epsilon}\)
cites work: Q4714131
cites work: The node-deletion problem for hereditary properties is NP-complete
cites work: The approximation of maximum subgraph problems
cites work: The Co-2-plex Polytope and Integral Systems
cites work: Combinatorial algorithms for the maximum \(k\)-plex problem
cites work: Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
cites work: A fast algorithm for the maximum clique problem
cites work: On clique relaxation models in network analysis
cites work: A graph‐theoretic generalization of the clique concept
cites work: Q4793326
cites work: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
cites work: Q4397004
cites work: An algorithm for finding a maximum clique in a graph
cites work: Node-and edge-deletion NP-complete problems
cites work: The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
DOI: 10.1007/S10589-013-9548-5
description: scientific article; zbMATH DE number 6201597