The following pages link to (Q4002466):
Displaying 50 items.
- Combinatorial PCPs with short proofs (Q260390) (← links)
- Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes (Q266936) (← links)
- Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges (Q269484) (← links)
- Two node-disjoint paths in balanced hypercubes (Q279509) (← links)
- Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions (Q279915) (← links)
- Faithful 1-edge fault tolerant graphs (Q286987) (← links)
- A new 3D representation of trivalent Cayley networks (Q287008) (← links)
- Disjoint Hamiltonian cycles in recursive circulant graphs (Q287012) (← links)
- Containment of butterflies in networks constructed by the line digraph operation (Q290188) (← links)
- Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks (Q290192) (← links)
- VLSI layouts of complete graphs and star graphs (Q293402) (← links)
- Christmas tree: a versatile 1-fault-tolerant design for token rings (Q294701) (← links)
- Cyclic-cubes and wrap-around butterflies (Q294788) (← links)
- Incidence coloring on hypercubes (Q300251) (← links)
- Complexity of linear circuits and geometry (Q300885) (← links)
- On some properties of doughnut graphs (Q334123) (← links)
- Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks (Q342731) (← links)
- More agents may decrease global work: a case in butterfly decontamination (Q343925) (← links)
- Diagnosable evaluation of enhanced optical transpose interconnection system networks (Q344567) (← links)
- Scheduling and routing of autonomous moving objects on a mesh topology (Q373248) (← links)
- On excessive index of certain networks (Q391312) (← links)
- Fault isolation and identification in general biswapped networks under the PMC diagnostic model (Q391320) (← links)
- Conditional edge-fault pancyclicity of augmented cubes (Q392181) (← links)
- Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges (Q394540) (← links)
- In-place permuting and perfect shuffling using involutions (Q396603) (← links)
- Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes (Q396672) (← links)
- Geodesic pancyclicity and balanced pancyclicity of the generalized base-\(b\) hypercube (Q412364) (← links)
- Decomposing the hypercube \(Q_n\) into \(n\) isomorphic edge-disjoint trees (Q418894) (← links)
- Geodesic pancyclicity of twisted cubes (Q424780) (← links)
- Bipanconnectivity of faulty hypercubes with minimum degree (Q426602) (← links)
- A special antidilation problem for meshes and Hamming graphs (Q432721) (← links)
- Embedding a mesh of trees in the crossed cube (Q436621) (← links)
- Succinct representations of permutations and functions (Q441860) (← links)
- One-to-many node-disjoint paths of hyper-star networks (Q442216) (← links)
- The \(g\)-good-neighbor conditional diagnosability of hypercube under PMC model (Q450261) (← links)
- Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism (Q450558) (← links)
- Testing connectivity of faulty networks in sublinear time (Q450565) (← links)
- A fast fault-identification algorithm for bijective connection graphs using the PMC model (Q454914) (← links)
- FREP: energy proportionality for disk storage using replication (Q455973) (← links)
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons (Q476439) (← links)
- Design of fault-tolerant on-board networks with variable switch sizes (Q476844) (← links)
- The pessimistic diagnosability of alternating group graphs under the PMC model (Q477609) (← links)
- Combinatorial PCPs with efficient verifiers (Q483706) (← links)
- Random walks, bisections and gossiping in circulant graphs (Q486995) (← links)
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267) (← links)
- The kissing problem: how to end a gathering when everyone kisses everyone else goodbye (Q489765) (← links)
- Embedding even cycles on folded hypercubes with conditional faulty edges (Q495675) (← links)
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance (Q497238) (← links)
- Adaptive system-level diagnosis for hypercube multiprocessors using a comparison model (Q497658) (← links)
