366 search results - page 28 / 74 » Dynamic Programming for Graphs on Surfaces |
ALENEX
2007
13 years 8 months ago
2007
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Parallelization of sequential programs is often daunting because of the substantial development cost involved. Various solutions have been proposed to address this concern, includ...
ISBRA
2009
Springer
14 years 2 months ago
2009
Springer
Recent techniques increase the amount of our knowledge of interactions between proteins. To filter, interpret and organize this data, many authors have provided tools for querying...
ICSE
2003
IEEE-ACM
14 years 7 months ago
2003
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...
ICSM
2002
IEEE
14 years 9 days ago
2002
IEEE
When a software system enters the maintenance phase, the availability of accurate and consistent information about its organization can help alleviate the difficulties of program...