Isolation concepts for clique enumeration: comparison and computational experiments
type: Item
instance of: scholarly article
title: Isolation concepts for clique enumeration: comparison and computational experiments
zbMATH Open document ID: 1192.68484
author: Falk Hüffner
author: Christian Komusiewicz
author: Hannes Moser
author: Rolf Niedermeier
published in: Theoretical Computer Science
publication date: 2009-11-25T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5638316
zbMATH Keywords: NP-hard problem
zbMATH Keywords: fixed-parameter tractability
zbMATH Keywords: exact algorithm
zbMATH Keywords: algorithm engineering
zbMATH Keywords: dense subgraph
describes a project that uses: Algorithm 457
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.05.008
OpenAlex ID: W2112128622
cites work: Efficiently covering complex networks with cliques of similar vertices
cites work: Statistical analysis of financial networks
cites work: Mining market data: a network approach
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: Clique-detection models in computational biochemistry and genomics
cites work: A note on the problem of reporting maximal cliques
cites work: Q4393480
cites work: Q4198056
cites work: Clique is hard to approximate within \(n^{1-\epsilon}\)
cites work: Enumeration of isolated cliques and pseudo-cliques
cites work: Algorithms – ESA 2005
cites work: Enumerating all connected maximal common subgraphs in two graphs
cites work: Isolation Concepts for Enumerating Dense Subgraphs
cites work: Introduction to Econophysics
cites work: On cliques in graphs
cites work: Q5710169
cites work: The worst-case time complexity for generating all maximal cliques and computational experiments
DOI: 10.1016/J.TCS.2009.05.008
description: scientific article; zbMATH DE number 5638316