46 search results - page 7 / 10 » Collapsible biclaw-free graphs |
ILP
2000
Springer
13 years 11 months ago
2000
Springer
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
BMCBI
2010
13 years 7 months ago
2010
Background: Today it is common to apply multiple potentially conflicting data sources to a given phylogenetic problem. At the same time, several different inference techniques are...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...