Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
type: Item
instance of: scholarly article
title: Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
zbMATH Open document ID: 1261.90081
author: Hannes Moser
author: Manuel Sorge
author: Rolf Niedermeier
published in: Journal of Combinatorial Optimization
publication date: 2013-01-03T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6121567
zbMATH Keywords: parameterized algorithmics
zbMATH Keywords: social network analysis
zbMATH Keywords: biological network analysis
zbMATH Keywords: NP-complete graph problems
zbMATH Keywords: dense subgraphs
zbMATH Keywords: \(s\)-plexes
zbMATH Keywords: \(k\)-dependent sets
describes a project that uses: Pajek
describes a project that uses: Pajek datasets
describes a project that uses: DIMACS
MaRDI profile type: Publication
full work available at URL: s10878-011-9391-5
OpenAlex ID: W2050952499
cites work: Crown structures for vertex cover kernelization
cites work: Novel approaches for analyzing biological networks
cites work: Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
cites work: Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes
cites work: Q3043782
cites work: Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion
cites work: Kernelization: New Upper and Lower Bound Techniques
cites work: A Linear Kernel for Co-Path/Cycle Packing
cites work: Q4268437
cites work: A Generalization of Nemhauser and Trotter's Local Optimization Theorem.
cites work: Parametrized complexity theory.
cites work: Iterative Compression for Exactly Solving NP-Hard Minimization Problems
cites work: A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing
cites work: Isolation concepts for clique enumeration: comparison and computational experiments
cites work: Fixed-parameter algorithms for cluster vertex deletion
cites work: Enumeration of isolated cliques and pseudo-cliques
cites work: Isolation concepts for efficiently enumerating dense subgraphs
cites work: The node-deletion problem for hereditary properties is NP-complete
cites work: Combinatorial algorithms for the maximum \(k\)-plex problem
cites work: Vertex packings: Structural properties and algorithms
cites work: Q5710169
cites work: A general method to speed up fixed-parameter-tractable algorithms
cites work: Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
cites work: A fast algorithm for the maximum clique problem
cites work: Application of an Annealed Neural Network to a Timetabling Problem
cites work: A graph‐theoretic generalization of the clique concept
DOI: 10.1007/S10878-011-9391-5
description: scientific article; zbMATH DE number 6121567