2531 search results - page 108 / 507 » Group testing in graphs |
STACS
2007
Springer
15 years 6 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
116
Voted
ICSE
2008
IEEE-ACM
16 years 1 months ago
2008
IEEE-ACM
WS-BPEL applications are a kind of service-oriented application. They use XPath extensively to integrate loosely-coupled workflow steps. However, XPath may extract wrong data from...
104
Voted
SIGSOFT
2008
ACM
16 years 1 months ago
2008
ACM
NesC is a programming language for applications that run on top of networked sensor nodes. Such an application mainly uses an interrupt to trigger a sequence of operations, known ...
99
Voted
ESA
1993
Springer
15 years 4 months ago
1993
Springer
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward ...
99
Voted
ICFEM
2009
Springer
15 years 5 months ago
2009
Springer
Structural constraint solving allows finding object graphs that satisfy given constraints, thereby enabling software reliability tasks, such as systematic testing and error recove...