715 search results - page 19 / 143 » On graphs with subgraphs having large independence numbers |
IS
2007
13 years 7 months ago
2007
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
COCOON
2000
Springer
13 years 12 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
EDBT
2009
ACM
14 years 3 days ago
2009
ACM
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
DM
2008
13 years 7 months ago
2008
For two graphs G and H, let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph wi...
RECOMB
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...