686 search results - page 106 / 138 » Packing Cycles in Graphs |
50
Voted
COMBINATORICS
2007
15 years 20 days ago
2007
A closed knight’s tour of a chessboard uses legal moves of the knight to visit every square exactly once and return to its starting position. When the chessboard is translated i...
110
Voted
ICCAD
1994
IEEE
15 years 4 months ago
1994
IEEE
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
102
Voted
KDD
2006
ACM
16 years 1 months ago
2006
ACM
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
CASES
2009
ACM
15 years 7 months ago
2009
ACM
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
97
Voted
SIES
2007
IEEE
15 years 7 months ago
2007
IEEE
— The research field of partitioning for electronic systems started to attract significant attention of scientists about fifteen years ago. Gaining ever more importance due to...