New Algorithms for Enumerating All Maximal Cliques (2004)

Cached

Download Links

by Kazuhisa Makino , Takeaki Uno
Citations:21 - 1 self

Active Bibliography

2 Generating Dual-Bounded Hypergraphs – Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Leonid Khachiyan - 2002
5 On maximal frequent and minimal infrequent sets in binary matrices – E. Boros, V. Gurvich, L. Khachiyan, K. Makino - 2003
Some fixed-parameter tractable classes of Dual and related problems ⋆ – Khaled Elbassioni, Matthias Hagen, Imran Rauf
35 On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets – E. Boros, V. Gurvich, L. Khachiyan, K. Makino - 2002
13 Dual-Bounded Generating Problems: Partial And Multiple Transversals Of A Hypergraph – Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino - 2001
2 An Incremental RNC Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension – E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan - 2000
1 Dual-Bounded Generating Problems: Weighted Transversals of a Hypergraph – E. Boros, V. Gurvich, L. Khachiyan, K. Makino - 2002
1 Dual-Bounded Hypergraphs: Generating Partial and Multiple Transversals – Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino - 1999
3 Generating Partial and Multiple Transversals of a Hypergraph – Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino - 2000
8 An Inequality for Polymatroid Functions and Its Applications – E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan - 2001
11 An efficient incremental algorithm for generating all maximal independent sets in hypergraphs of bounded dimension – E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan - 2000
3 Generating Weighted Transversals of a Hypergraph – Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino - 2000
3 Abduction and the Dualization Problem – Thomas Eiter, Kazuhisa Makino - 2003
18 Hypergraph Transversal Computation and Related Problems in Logic and AI – Thomas Eiter, Georg Gottlob - 2002
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric – Khaled Elbassioni, Kazuhisa Makino, Imran Rauf
2 Transaction databases, frequent itemsets, and their condensed representations – Taneli Mielikäinen
1 Faster algorithms for constructing a galois lattice, enumerating all maximal bipartite cliques and closed frequent sets – Vicky Choi, Yang Huang - 2006
6 An intersection inequality for discrete distributions and related generation problems – E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan, K. Makino - 2003
2 Matroid Intersections, Polymatroid Inequalities, and Related Problems – Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Leonid Khachiyan - 2002