Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay

2014 ◽  
pp. 81-93 ◽  
Author(s):  
Andre Droschinsky ◽  
Bernhard Heinemann ◽  
Nils Kriege ◽  
Petra Mutzel
Keyword(s):  
Polynomial Delay

scholarly journals Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs

2015 ◽  
pp. 446-457 ◽  
Author(s):  
Mamadou Moustapha Kanté ◽  
Vincent Limouzy ◽  
Arnaud Mary ◽  
Lhouari Nourine ◽  
Takeaki Uno
Keyword(s):  
Dominating Sets ◽  
Polynomial Delay

Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph

2013 ◽  
pp. 308-323 ◽  
Author(s):  
Kunihiro Wasa ◽  
Takeaki Uno ◽  
Kouichi Hirata ◽  
Hiroki Arimura
Keyword(s):  
Polynomial Delay

scholarly journals Generating Models of a Matched Formula With a Polynomial Delay (Extended Abstract)

2017 ◽  
Author(s):  
Petr Savický ◽  
Petr Kučera
Keyword(s):  
Polynomial Time ◽  
Parameterized Complexity ◽  
The Other ◽  
Incidence Graph ◽  
Distinct Variable ◽  
Other Hand ◽  
Polynomial Delay

A matched formula is a CNF formula whose incidence graph admits a matching which matches a distinct variable to every clause. Such a formula is always satisfiable. Matched formulas are used, for example, in the area of parameterized complexity. We prove that the problem of counting the number of the models (satisfying assignments) of a matched formula is #P-complete. On the other hand, we define a class of formulas generalizing the matched formulas and prove that for a formula in this class one can choose in polynomial time a variable suitable for splitting the tree for the search of the models of the formula. As a consequence, the models of a formula from this class, in particular of any matched formula, can be generated sequentially with a delay polynomial in the size of the input. On the other hand, we prove that this task cannot be performed efficiently for linearly satisfiable formulas, which is a generalization of matched formulas containing the class considered above.

scholarly journals Efficiently Sparse Listing of Classes of Optimal Cophylogeny Reconciliations

2021 ◽  
Author(s):  
Yishu Wang ◽  
Arnaud Mary ◽  
Marie-France Sagot ◽  
Blerina Sinaimeri
Keyword(s):  
Optimization Problem ◽  
Practical Importance ◽  
Biological Information ◽  
Optimal Solutions ◽  
Powerful Method ◽  
New Approach ◽  
Significant Research ◽  
Whole Space ◽  
Polynomial Delay ◽  
Host Parasite

Abstract Background: Cophylogeny reconciliation is a powerful method for analyzing host-parasite (or host-symbiont) co-evolution. It models co-evolution as an optimization problem where the set of all optimal solutions may represent different biological scenarios which thus need to be analyzed separately. Despite the significant research done in the area, few approaches have addressed the problem of helping the biologist deal with the often huge space of optimal solutions.Results: In this paper, we propose a new approach to tackle this problem. We introduce three different criteria under which two solutions may be considered biologically equivalent, and then we propose polynomial-delay algorithms that enumerate only one representative per equivalence class (without listing all the solutions).Conclusions: Our results are of both theoretical and practical importance. Indeed, as shown by the experiments, we are able to significantly reduce the space of optimal solutions while still maintaining important biological information about the whole space.

Polynomial-delay construction of irreducible coverings of a Boolean matrix

2007 ◽  
Vol 75 (2) ◽  
pp. 292-294
Author(s):  
E. V. Djukova ◽  
A. S. Inyakin
Keyword(s):  
Boolean Matrix ◽  
Polynomial Delay

scholarly journals Polynomial-Delay Enumeration of Maximal Common Subsequences

2019 ◽  
pp. 189-202
Author(s):  
Alessio Conte ◽  
Roberto Grossi ◽  
Giulia Punzi ◽  
Takeaki Uno
Keyword(s):  
Polynomial Delay
Sign in / Sign up

Export Citation Format

Share Document