Sciweavers

1097 search results - page 68 / 220
» Testing Graph Isomorphism
Sort
View
ICPR
2004
IEEE
15 years 11 months ago
Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
Fred W. DePiero
JAIR
2008
123views more  JAIR 2008»
14 years 10 months ago
The Computational Complexity of Dominance and Consistency in CP-Nets
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
Judy Goldsmith, Jérôme Lang, Miroslaw...
AGTIVE
1999
Springer
15 years 2 months ago
DiTo - A Distribution Tool Based on Graph Rewriting
Abstract. In the paper Support for Design Patterns through Graph Transformation Tools in this volume, we have already outlined the global structure of a tool that allows for the an...
Ansgar Radermacher
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
15 years 7 months ago
Randomization Techniques for Graphs.
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
Gemma C. Garriga, Kai Puolamäki, Sami Hanhij&...
ISSTA
2006
ACM
15 years 3 months ago
Towards regression test selection for AspectJ programs
Regression testing aims at showing that code has not been adversely affected by modification activities during maintenance. Regression test selection techniques reuse tests from...
Jianjun Zhao, Tao Xie, Nan Li