9842 search results - page 17 / 1969 » The Complexity of the Matching-Cut Problem |
FOCS
1997
IEEE
13 years 11 months ago
1997
IEEE
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
APWEB
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. One of the emerging concepts in microdata protection is kanonymity, introduced by Samarati and Sweeney. k-anonymity provides a simple and efficient approach to protect pr...
LOGCOM
2010
13 years 6 months ago
2010
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
ENDM
2007
13 years 7 months ago
2007
Given a metric d on a permutation group G, the corresponding weight problem is to decide whether there exists an element g ∈ G such that d(g, e) = k for some k ∈ N. In this pa...
EOR
2002
13 years 7 months ago
2002
The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) ...