1097 search results - page 77 / 220 » Testing Graph Isomorphism |
ICOIN
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
DAM
2006
14 years 10 months ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
CONCUR
2006
Springer
15 years 1 months ago
2006
Springer
Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to...
KBSE
2008
IEEE
15 years 4 months ago
2008
IEEE
—Automated tests are important for Web applications as they grow more complex day by day. Web application testing frameworks have emerged to help satisfy this need. However, used...
SAC
2008
ACM
14 years 9 months ago
2008
ACM
Test case prioritization for regression testing can be performed using different metrics (e.g., statement coverage, path coverage) depending on the application context. Employing ...