Sciweavers

1097 search results - page 78 / 220
» Testing Graph Isomorphism
Sort
View
EJC
2007
14 years 10 months ago
Quickly deciding minor-closed parameters in general graphs
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
ISSTA
2000
ACM
15 years 2 months ago
OMEN: A strategy for testing object-oriented software
This paper presents a strategy for structural testing of objectoriented software systems with possibly unknown clients and unknown information about invoked methods. By exploiting...
Amie L. Souter, Lori L. Pollock
ISSRE
2006
IEEE
15 years 4 months ago
A Systematic Approach to Generate Inputs to Test UML Design Models
Practical model validation techniques are needed for model driven development (MDD) techniques to succeed. This paper presents an approach to generating inputs to test UML design ...
Trung T. Dinh-Trong, Sudipto Ghosh, Robert B. Fran...
AAAI
2010
14 years 11 months ago
Dominance Testing via Model Checking
Dominance testing, the problem of determining whether an outcome is preferred over another, is of fundamental importance in many applications. Hence, there is a need for algorithm...
Ganesh Ram Santhanam, Samik Basu, Vasant Honavar
BMCBI
2008
208views more  BMCBI 2008»
14 years 10 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...