The following pages link to (Q4002466):
Displaying 50 items.
- The bipanpositionable bipancyclic property of the hypercube (Q979832) (← links)
- Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position (Q979841) (← links)
- Conditional edge-fault Hamiltonicity of augmented cubes (Q985082) (← links)
- On path bipancyclicity of hypercubes (Q987833) (← links)
- Embedding cycles of various lengths into star graphs with both edge and vertex faults (Q988635) (← links)
- A further result on fault-free cycles in faulty folded hypercubes (Q990097) (← links)
- Cycles embedding in exchanged hypercubes (Q990110) (← links)
- Cycle embedding of augmented cubes (Q990439) (← links)
- Path embedding in faulty hypercubes (Q990515) (← links)
- Pancyclicity and bipancyclicity of conditional faulty folded hypercubes (Q991233) (← links)
- The panpositionable panconnectedness of augmented cubes (Q991906) (← links)
- On the spanning connectivity and spanning laceability of hypercube-like networks (Q995576) (← links)
- On compact and efficient routing in certain graph classes (Q997073) (← links)
- On randomized broadcasting in star graphs (Q1003763) (← links)
- On the bipanpositionable bipanconnectedness of hypercubes (Q1006052) (← links)
- On embedding subclasses of height-balanced trees in hypercubes (Q1006750) (← links)
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem (Q1007120) (← links)
- Improving the average delay of sorting (Q1007244) (← links)
- Generalized honeycomb torus (Q1007598) (← links)
- Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs (Q1007617) (← links)
- The bipancycle-connectivity of the hypercube (Q1007866) (← links)
- Long paths in hypercubes with conditional node-faults (Q1010144) (← links)
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes (Q1014404) (← links)
- A spectral lower bound for the treewidth of a graph and its consequences (Q1014419) (← links)
- Shelling Coxeter-like complexes and sorting on trees (Q1018417) (← links)
- The exponent of Cartesian product of cycles (Q1021885) (← links)
- Fault-free cycles passing through prescribed paths in hypercubes with faulty edges (Q1023065) (← links)
- Boolean circuit programming: A new paradigm to design parallel algorithms (Q1026240) (← links)
- Improved book-embeddings of incomplete hypercubes (Q1028113) (← links)
- Hamiltonian connectivity of the WK-recursive network with faulty nodes (Q1031676) (← links)
- Embedding height balanced trees and Fibonacci trees in hypercubes (Q1031992) (← links)
- Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\) (Q1036825) (← links)
- A generalization of the 0-1 principle for sorting (Q1041721) (← links)
- Survey on path and cycle embedding in some networks (Q1042541) (← links)
- Embedding the incomplete hypercube in books (Q1044693) (← links)
- Optimal many-to-one routing on the mesh with constant queues (Q1044696) (← links)
- Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs (Q1044915) (← links)
- Cayley graphs as models of deterministic small-world networks (Q1045911) (← links)
- The average diameter of general tree structures (Q1125035) (← links)
- On XRAM and PRAM models, and on data-movement-intensive problems (Q1127554) (← links)
- Efficient delay routing (Q1128715) (← links)
- Real-time emulations of bounded-degree networks (Q1128816) (← links)
- Embedding meshes of trees into deBruijn graphs (Q1199946) (← links)
- Non-associative parallel prefix computation (Q1201872) (← links)
- Fault-tolerant routing in unique-path multistage Omega network (Q1208440) (← links)
- The 4-star graph is not a subgraph of any hypercube (Q1209989) (← links)
- Sorting in linear time? (Q1273863) (← links)
- An efficient multiway merging algorithm (Q1286689) (← links)
- Scheduling a divisible task in a two-dimensional toroidal mesh (Q1293188) (← links)
- A parallel algorithm for solving Toeplitz linear systems (Q1294265) (← links)
