1648 search results - page 161 / 330 » On the generation of bicliques of a graph |
FUIN
2008
13 years 10 months ago
2008
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
PKDD
2010
Springer
13 years 8 months ago
2010
Springer
Pattern mining methods for graph data have largely been restricted to ground features, such as frequent or correlated subgraphs. Kazius et al. have demonstrated the use of elaborat...
ICTAC
2004
Springer
14 years 3 months ago
2004
Springer
A model-based approach for minimization of test sets for interactive systems is introduced. Test cases are efficiently generated and selected to cover the behavioral model and the ...
COCOA
2008
Springer
13 years 11 months ago
2008
Springer
We present efficient algorithms to generate all edge-magic and vertex-magic total labelings on cycles, and all vertex-magic total labelings on wheels. Using these algorithms, we ex...
CORR
2002
Springer
13 years 10 months ago
2002
Springer
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...