An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem
Author:
- 18 October 2008
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 56 (1) , 3-16
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Mining coherent dense subgraphs across massive biological networks for functional discoveryBioinformatics, 2005
- Efficient Substructure Discovery from Large Semi-structured Data2002
- The Dense k -Subgraph ProblemAlgorithmica, 2001
- Approximation of Optimal Two-Dimensional Association Rules for Categorical Attributes Using Semidefinite ProgrammingLecture Notes in Computer Science, 1999
- Trawling the Web for emerging cyber-communitiesComputer Networks, 1999
- Reverse search for enumerationDiscrete Applied Mathematics, 1996
- Polynomial time approximation schemes for dense instances of NP-hard problems1995
- Finding all minimum‐cost perfect matchings in Bipartite graphsNetworks, 1992
- A Fast Parametric Maximum Flow Algorithm and ApplicationsSIAM Journal on Computing, 1989
- Some simplified NP-complete problems1974