9842 search results - page 1479 / 1969 » The Complexity of the Matching-Cut Problem |
165
click to vote
SSS
2005
Springer
16 years 14 days ago
2005
Springer
Abstract. A snap-stabilizing protocol, starting from any arbitrary initial configuration, always behaves according to its specification. In [4], we presented the first snap-stab...
146
click to vote
UML
2005
Springer
16 years 14 days ago
2005
Springer
Abstract. Use Cases are widely used for specifying systems, but their semantics are unclear in ways that make it difficult to apply use cases to complex problems. In this paper, we...
183
click to vote
VLDB
2005
ACM
16 years 14 days ago
2005
ACM
When a private relational table is published using views, secrecy or privacy may be violated. This paper uses a formally-defined notion of k-anonymity to measure disclosure by vi...
205
click to vote
WAOA
2005
Springer
16 years 14 days ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
198
click to vote
WDAG
2005
Springer
16 years 14 days ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...