Sciweavers

2531 search results - page 102 / 507
» Group testing in graphs
Sort
View
86
Voted
CONCUR
2006
Springer
15 years 4 months ago
Concurrent Rewriting for Graphs with Equivalences
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...
Paolo Baldan, Fabio Gadducci, Ugo Montanari
KBSE
2008
IEEE
15 years 7 months ago
An Automated Test Code Generation Method for Web Applications using Activity Oriented Approach
—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...
David A. Turner, Moonju Park, Jaehwan Kim, Jinseok...
SAC
2008
ACM
15 years 6 days ago
PHALANX: a graph-theoretic framework for test case prioritization
Test case prioritization for regression testing can be performed using different metrics (e.g., statement coverage, path coverage) depending on the application context. Employing ...
Murali Krishna Ramanathan, Mehmet Koyutürk, A...
EJC
2007
15 years 21 days 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
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
15 years 6 months ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...