Massive Quasi-Clique Detection
Authors:
- 14 March 2002
- book chapter
- Published by Springer Nature
- p. 598-612
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Approximating clique is almost NP-complete2002
- Handbook of Massive Data Sets2002
- External Memory Algorithms1999
- Clique is hard to approximate within n1−εActa Mathematica, 1999
- A Functional Approach to External Graph Algorithms1998
- Probabilistic checking of proofsJournal of the ACM, 1998
- Proof verification and hardness of approximation problems1992
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- A probabilistic heuristic for a computationally difficult set covering problemOperations Research Letters, 1989
- Optimization by Simulated AnnealingScience, 1983