Efficient algorithms for dualizing large-scale hypergraphs
Keisuke Murakami,Takeaki Uno +1 more
62
TL;DR: In this paper, a polynomial space dualization algorithm was proposed to check the minimal hitting set enumeration of a subset family, generation problem for maximal frequent and minimal infrequent sets, and so on.
read more
About: This article is published in Discrete Applied Mathematics. The article was published on 01 Jun 2014. and is currently open access. The article focuses on the topics: Vertex (graph theory) & Hypergraph.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Efficient Enumeration of Maximal k-Plexes
Devora Berlowitz,Sara Cohen,Benny Kimelfeld +2 more
- 27 May 2015
TL;DR: This paper presents the first provably efficient algorithms, both for enumeration the maximal k-plexes and for enumerating the maximal connected k-Plexes, and their scalability with respect to graph size, density and choice of k, as well as their clear superiority over the state-of-the-art.
82
Implementing Efficient All Solutions SAT Solvers
Takahisa Toda,Takehide Soh +1 more
TL;DR: A survey and discussion of major techniques of AllSAT solvers can be found in this paper, where they faithfully implement them and conduct comprehensive experiments using a large number of instances and various types of solvers including one of the few public softwares.
72
Implementing Efficient All Solutions SAT Solvers
Takahisa Toda,Takehide Soh +1 more
TL;DR: A survey and discussion of major techniques of AllSAT solvers can be found in this article, where the authors accurately implemented them and conducted comprehensive experiments using a large number of instances and various types of solvers including a few publicly available software.
70
The joy of implications, aka pure Horn formulas
TL;DR: A survey of mathematical theory of implications with an emphasis on the progress made in the last 30 years can be found in this paper, where the authors discuss functional dependencies, strong association rules, and implications.
45
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
Mamadou Moustapha Kanté,Vincent Limouzy,Arnaud Mary,Lhouari Nourine,Takeaki Uno +4 more
- 05 Aug 2015
TL;DR: A new technique to enlarge the applicability of Berge’s algorithm that is based on skipping hard parts of the enumeration by introducing a new search strategy given by a strong use of the structure of line graphs is proposed.
References
The worst-case time complexity for generating all maximal cliques and computational experiments
TL;DR: A depth-first search algorithm for generating all maximal cliques of an undirected graph, in which pruning methods are employed as in the Bron-Kerbosch algorithm, which proves that its worst-case time complexity is O(3n/3) for an n-vertex graph.
907
Reverse search for enumeration
David Avis,Komei Fukuda +1 more
TL;DR: This paper develops the reverse search technique in a general framework and shows its broader applications to various problems in operations research, combinatorics, and geometry, and proposes new algorithms for listing.
899
On the Complexity of Dualization of Monotone Disjunctive Normal Forms
TL;DR: It is shown that the duality of a pair of monotone disjunctive normal forms of sizencan be tested inno(logn)time.
502
Computational aspects of monotone dualization: A brief survey
TL;DR: This paper focuses on the famous paper by Fredman and Khachiyan, which showed that the dualization of monotone disjunctive normal forms is solvable in quasi-polynomial time (and thus most likely not co-NP-hard), as well as on follow-up works.
201