Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs
From MaRDI portal
Publication:2316931
DOI10.1016/j.jcss.2019.02.005zbMath1423.68355OpenAlexW2943552721WikidataQ128021788 ScholiaQ128021788MaRDI QIDQ2316931
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
Publication date: 7 August 2019
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2019.02.005
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (1)
Cites Work
- Unnamed Item
- Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
- On the generalized twisted cube
- Disjoint cycles and spanning graphs of hypercubes
- Complete binary trees embeddings in Möbius cubes
- An efficient algorithm to construct disjoint path covers of DCell networks
- Spanning graphs of hypercubes: Starlike and double starlike trees
- Recursive circulants and their embeddings among hypercubes
- Disjoint path covers with path length constraints in restricted hypercube-like graphs
- Many-to-many two-disjoint path covers in restricted hypercube-like graphs
- One-legged caterpillars span hypercubes
- Embedding $m$-quasistars into $n$-cubes
- On Path Cover Problems in Digraphs and Applications to Program Testing
- The Mobius cubes
- Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
- Spanning caterpillars of a hypercube
- Embedding double starlike trees into hypercubes
- Disjoint paths in hypercubes with prescribed origins and lengths
This page was built for publication: Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs
