601 search results - page 75 / 121 » Edge-dominating cycles in graphs |
CGA
1998
13 years 8 months ago
1998
This paper describes methods and data structures used to leverage motion sequences of complex linked figures. We present a technique for interpolating between example motions der...
JCO
1998
13 years 8 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
OOPSLA
2010
Springer
13 years 7 months ago
2010
Springer
Inclusion-based points-to analysis provides a good trade-off between precision of results and speed of analysis, and it has been incorporated into several production compilers inc...
COMBINATORICS
2007
13 years 8 months ago
2007
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...
FAST
2009
13 years 6 months ago
2009
Versioning file systems provide the ability to recover from a variety of failures, including file corruption, virus and worm infestations, and user mistakes. However, using versio...