New Algorithms for Enumerating All Maximal Cliques
Authors:
- 1 January 2004
- book chapter
- Published by Springer Nature
- p. 260-272
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On Maximal Frequent and Minimal Infrequent Sets in Binary MatricesAnnals of Mathematics and Artificial Intelligence, 2003
- New Results on Monotone Dualization and Generating Hypergraph TransversalsSIAM Journal on Computing, 2003
- Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear InequalitiesSIAM Journal on Computing, 2002
- Trawling the Web for emerging cyber-communitiesComputer Networks, 1999
- Reverse search for enumerationDiscrete Applied Mathematics, 1996
- Arboricity and bipartite subgraph listing algorithmsInformation Processing Letters, 1994
- Efficient Algorithms for Listing Combinatorial Structures1993
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- On generating all maximal independent setsInformation Processing Letters, 1988
- Arboricity and Subgraph Listing AlgorithmsSIAM Journal on Computing, 1985