Results 1  10
of
994,612
On Orthogonal Double Covers By Trees
 J. COMBIN. DES
, 1996
"... A collection P of n spanning subgraphs of the complete graph Kn is said to be an Orthogonal Double Cover (ODC) if every edge of Kn belongs to exactly two members of P and every two elements of P share exactly one edge. We consider the case when all graphs in P are isomorphic to some tree G and impro ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
A collection P of n spanning subgraphs of the complete graph Kn is said to be an Orthogonal Double Cover (ODC) if every edge of Kn belongs to exactly two members of P and every two elements of P share exactly one edge. We consider the case when all graphs in P are isomorphic to some tree G
Orthogonal double covers of complete bipartite graphs
 AUSTRALASIAN JOURNAL OF COMBINATORICS VOLUME 49 (2011), PAGES 15–18
, 2011
"... Let H = {A1,...,An,B1,...,Bn} be a collection of 2n subgraphs of the complete bipartite graph Kn,n. The collection H is called an orthogonal double cover (ODC) of Kn,n if each edge of Kn,n occurs in exactly two of the graphs in H; E(Ai) ∩ E(Aj) =φ = E(Bi) ∩ E(Bj) for every i, j ∈ {1,...,n} with i ..."
Abstract
 Add to MetaCart
Let H = {A1,...,An,B1,...,Bn} be a collection of 2n subgraphs of the complete bipartite graph Kn,n. The collection H is called an orthogonal double cover (ODC) of Kn,n if each edge of Kn,n occurs in exactly two of the graphs in H; E(Ai) ∩ E(Aj) =φ = E(Bi) ∩ E(Bj) for every i, j ∈ {1,...,n} with i
On Orthogonal Double Covers by Hamilton Paths
, 1998
"... An Orthogonal Double Cover (ODC) of the complete graph K n is a set of isomorphic graphs such that two of them share exactly one edge and all together cover the complete graph twice. In the case of paths the problem is also known as selforthogonal Hamilton path decomposition of 2K n . Solutions ..."
Abstract
 Add to MetaCart
An Orthogonal Double Cover (ODC) of the complete graph K n is a set of isomorphic graphs such that two of them share exactly one edge and all together cover the complete graph twice. In the case of paths the problem is also known as selforthogonal Hamilton path decomposition of 2K n . Solutions
On Orthogonal Covers Of ...
, 1998
"... An orthogonal cover of the complete digraph ~ K n is a collection of n spanning subgraphs ~ G 1 , ~ G 2 , ..., ~ G n of ~ K n such that  every directed edge of ~ K n belongs to exactly 1 of the ~ G i 's and  for every two digraphs ~ G i and ~ G j (i 6= j) there is a unique twoe ..."
Abstract
 Add to MetaCart
An orthogonal cover of the complete digraph ~ K n is a collection of n spanning subgraphs ~ G 1 , ~ G 2 , ..., ~ G n of ~ K n such that  every directed edge of ~ K n belongs to exactly 1 of the ~ G i 's and  for every two digraphs ~ G i and ~ G j (i 6= j) there is a unique
Network Centric Warfare: Developing and Leveraging Information Superiority
 Command and Control Research Program (CCRP), US DoD
, 2000
"... the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technolo ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
aspect of the CCRP program is its ability to serve as a bridge between the operational, technical, analytical, and educational communities. The CCRP provides leadership for the command and control research community by: n n
Orthogonal Colorings of Graphs
"... An orthogonal coloring of a graph G is a pair fc 1 ; c 2 g of proper colorings of G, having the property that if two vertices are colored with the same color in c 1 , then they must have distinct colors in c 2 . The notion of orthogonal colorings is strongly related to the notion of orthogonal La ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
, in addition, n is an integer square, then we say that G has a perfect orthogonal coloring, since for any two colors x and y, there is exactly one vertex colored by x in c 1 and by y in c 2 . The purpose of this paper is to study the parameter O(G) and supply upper bounds to it which depend on other graph
A Comparison of Dynamic Branch Predictors that use Two Levels of Branch History
 in Proceedings of the 20th Annual International Symposium on Computer Architecture
, 1993
"... Recent attention to speculative execution as a mechanism for increasing performance of single instruction streams has demanded substantially better branch prediction than what has been previously available. We [1, 2] and Pan, So, and Rahmeh [4] have both proposed variations of the same aggressive dy ..."
Abstract

Cited by 279 (9 self)
 Add to MetaCart
Recent attention to speculative execution as a mechanism for increasing performance of single instruction streams has demanded substantially better branch prediction than what has been previously available. We [1, 2] and Pan, So, and Rahmeh [4] have both proposed variations of the same aggressive
On Cartesian Products of Cyclic Orthogonal Double Covers of Circulants
"... A collection G of isomorphic copies of a given subgraph G of T is said to be orthogonal double cover (ODC) of a graph T by G, if every edge of T belongs to exactly two members of G and any two different elements from G share at most one edge. An ODC G of T is cyclic (CODC) if the cyclic group of ord ..."
Abstract
 Add to MetaCart
A collection G of isomorphic copies of a given subgraph G of T is said to be orthogonal double cover (ODC) of a graph T by G, if every edge of T belongs to exactly two members of G and any two different elements from G share at most one edge. An ODC G of T is cyclic (CODC) if the cyclic group
General Cyclic Orthogonal Double Covers of Finite Regular Circulant Graphs
"... An orthogonal double cover (ODC) of a graph H is a collection () {}vG v V H: = ∈ of ()V H subgraphs (pages) of H, so that they cover every edge of H twice and the intersection of any two of them contains exactly one edge. An ODC of H is cyclic (CODC) if the cyclic group of order ()V H is a subgr ..."
Abstract
 Add to MetaCart
An orthogonal double cover (ODC) of a graph H is a collection () {}vG v V H: = ∈ of ()V H subgraphs (pages) of H, so that they cover every edge of H twice and the intersection of any two of them contains exactly one edge. An ODC of H is cyclic (CODC) if the cyclic group of order ()V H is a
Results 1  10
of
994,612