270 search results - page 17 / 54 » Properties of Almost All Graphs and Generalized Quantifiers |
BIRTHDAY
2010
Springer
13 years 7 months ago
2010
Springer
The title of this paper, besides being a pun, can be taken to mean either the frontier of research in graph transformation, or the advantage of using graph transformation. To focus...
ICCD
2004
IEEE
14 years 4 months ago
2004
IEEE
Formal and dynamic (simulation, emulation, etc.) verification techniques are both needed to deal with the overall challenge of verification. Ideally, the same specification/tes...
CSR
2007
Springer
14 years 1 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
EDBT
2009
ACM
14 years 2 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
JUCS
2002
13 years 7 months ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...