753 search results - page 21 / 151 » Completing a (k - 1)-Assignment |
ALGORITHMICA
2005
14 years 9 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
SIGCSE
2006
ACM
15 years 3 months ago
2006
ACM
This paper examines software designs produced by students nearing completion of their Computer Science degrees. The results of this multi-national, multi-institutional experiment ...
EUROPAR
2005
Springer
15 years 3 months ago
2005
Springer
Maintaining spanning trees in a distributed fashion is central to many networking applications. In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tr...
SIGUCCS
2003
ACM
15 years 3 months ago
2003
ACM
Internal Study Groups at Colgate University have increased staff members’ technical knowledge, encouraged additional study on selected topics, and resulted in achievement of ind...
UAI
1992
14 years 11 months ago
1992
In this paper, a unified framework for representing uncertain information based on the notion of an interval structure is proposed. It is shown that the lower and upper approximat...