9842 search results - page 372 / 1969 » The Complexity of the Matching-Cut Problem |
158
click to vote
ICDT
2007
ACM
15 years 10 months ago
2007
ACM
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
152
click to vote
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
164
click to vote
IUI
2004
ACM
15 years 9 months ago
2004
ACM
People are performing increasingly complicated actions on the web, such as automated purchases involving multiple sites. Things often go wrong, however, and it can be difficult to...
126
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
135
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...