686 search results - page 81 / 138 » Packing Cycles in Graphs |
89
Voted
ASAP
2006
IEEE
15 years 4 months ago
2006
IEEE
Parameterized static affine nested loop programs can be automatically converted to input-output equivalent Kahn Process Network specifications. These networks turn out to be close...
75
Voted
DM
1998
15 years 8 days ago
1998
We prove the conjecture of Abbott and Katchalski that for every m ≥ 2 there is a positive constant λm such that S(Kd mn) ≥ λmnd−1 S(Kd−1 m ) where S(Kd m) is the length o...
101
Voted
HEURISTICS
2002
15 years 11 days ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
100
Voted
COMBINATORICS
2007
15 years 18 days 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...
91
Voted
PSB
2004
15 years 2 months ago
2004
Association studies in populations relate genomic variation among individuals with medical condition. Key to these studies is the development of efficient and affordable genotypin...