618 search results - page 34 / 124 » Short cycle connectivity |
HPCA
1997
IEEE
14 years 2 months ago
1997
IEEE
In this paper we explore software-managed address translation. The purpose of the study is to specify the memory management design for a high clock-rate PowerPC implementation in ...
COMBINATORICS
2007
13 years 9 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...
COMBINATORICS
2004
13 years 9 months ago
2004
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing...
SSC
2007
Springer
14 years 3 months ago
2007
Springer
In this short note we introduce two new sequences defined using the sum of digits in the representation of an integer in a certain base. A connection to Niven numbers is proposed ...
DCG
2007
13 years 9 months ago
2007
We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circula...