Sciweavers

26 search results - page 5 / 6
» Isomorphism Checking in GROOVE
Sort
View
EJC
2008
13 years 6 months ago
Grad and classes with bounded expansion II. Algorithmic aspects
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
Jaroslav Nesetril, Patrice Ossona de Mendez
IEE
2008
115views more  IEE 2008»
13 years 6 months ago
Faithful mapping of model classes to mathematical structures
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
Ádám Darvas, Peter Müller
LOGCOM
2008
110views more  LOGCOM 2008»
13 years 6 months ago
Sum and Product in Dynamic Epistemic Logic
The Sum-and-Product riddle was first published in [Fre69]. We provide an overview on the history of the dissemination of this riddle through the academic and puzzle-math community...
Hans P. van Ditmarsch, Ji Ruan, Rineke Verbrugge
IDA
2007
Springer
13 years 5 months ago
Inference of node replacement graph grammars
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
EDBT
2009
ACM
138views Database» more  EDBT 2009»
14 years 23 days ago
FOGGER: an algorithm for graph generator discovery
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...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou