356 search results - page 61 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
113
click to vote
FCT
2009
Springer
15 years 7 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
STOC
2007
ACM
16 years 19 days ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
114
Voted
ISSTA
2009
ACM
15 years 6 months ago
2009
ACM
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
112
click to vote
IWOCA
2009
Springer
15 years 6 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
143
click to vote
Presentation
In recent years, the use of performance measures for transit planning and operations has gained a great deal of attention, particularly as transit agencies are required to provide ...