An efficient algorithm for solving pseudo clique enumeration problem
type: Item
instance of: scholarly article
title: An efficient algorithm for solving pseudo clique enumeration problem
zbMATH Open document ID: 1187.68354
author: Takeaki Uno
published in: Algorithmica
publication date: 2010-02-23T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5674317
zbMATH Keywords: dense subgraph
zbMATH Keywords: maximum subgraph
zbMATH Keywords: pseudo clique
zbMATH Keywords: quasi clique
zbMATH Keywords: dense structure
zbMATH Keywords: clustering
zbMATH Keywords: community discovering
zbMATH Keywords: enumeration
zbMATH Keywords: mining
zbMATH Keywords: algorithm
describes a project that uses: LCM
MaRDI profile type: Publication
full work available at URL: s00453-008-9238-3
OpenAlex ID: W2009723146
cites work: Q4252271
cites work: Q4234075
cites work: Q4405997
cites work: Reverse search for enumeration
cites work: The dense \(k\)-subgraph problem
cites work: Finding all minimum-cost perfect matchings in Bipartite graphs
cites work: A Fast Parametric Maximum Flow Algorithm and Applications
cites work: Some simplified NP-complete graph problems
cites work: Algorithm Theory - SWAT 2004
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
cites work: The worst-case time complexity for generating all maximal cliques and computational experiments
cites work: An Efficient Algorithm for Enumerating Pseudo Cliques
DOI: 10.1007/S00453-008-9238-3
description: scientific article; zbMATH DE number 5674317