Enumerating Isolated Cliques in Synthetic and Financial Networks
type: Item
instance of: scholarly article
title: Enumerating Isolated Cliques in Synthetic and Financial Networks
zbMATH Open document ID: 1168.05367
DOI: 10.1007/978-3-540-85097-7_38
author: Falk Hüffner
author: Christian Komusiewicz
author: Hannes Moser
author: Rolf Niedermeier
published in: Combinatorial Optimization and Applications
publication date: 2009-01-27T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 91B28
zbMATH DE Number: 5498475
MaRDI profile type: Publication
full work available at URL: 978-3-540-85097-7 38
OpenAlex ID: W1592981318
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: Clique-detection models in computational biochemistry and genomics
cites work: Q4503944
cites work: Q4198056
cites work: Clique is hard to approximate within \(n^{1-\epsilon}\)
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: The worst-case time complexity for generating all maximal cliques and computational experiments
description: scientific article; zbMATH DE number 5498475