9842 search results - page 399 / 1969 » The Complexity of the Matching-Cut Problem |
183
click to vote
SPRINGSIM
2010
15 years 2 months ago
2010
Concise and reliable graph-theoretic analysis of complex networks today is a cumbersome task, consisting essentially of the adaptation of intricate libraries for each specific pr...
122
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent o...
156
click to vote
CP
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...
115
click to vote
LATIN
1998
Springer
15 years 8 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
110
click to vote
AISC
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...