On the public citation graph
Completely independent spanning trees in torus networks
0 signed · 94 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1097-0037(199603)27:2<159::aid-net7>3.0.co;2-jopenalex-snapshot
Circuit-switched row-column broadcasting in torus and mesh networks
inferredcites →https://doi.org/10.1002/(sici)1097-0037(199808)32:1<1::aid-net1>3.0.co;2-gopenalex-snapshot
Diameter-preserving orientations of the torus
inferredcites →https://doi.org/10.1002/net.20155openalex-snapshot
Vertex disjoint routings of cycles over tori
inferredcites →https://doi.org/10.1006/jpdc.2001.1751openalex-snapshot
Multicast in Wormhole-Switched Torus Networks Using Edge-Disjoint Spanning Trees
inferredcites →https://doi.org/10.1007/3-540-36379-3_21openalex-snapshot
Completely Independent Spanning Trees in Maximal Planar Graphs
inferredcites →https://doi.org/10.1007/pl00021190openalex-snapshot
Independent Trees in Planar Graphs Independent trees
inferredcites →https://doi.org/10.1007/s003730050041openalex-snapshot
Independent Trees and Branchings in Planar Multigraphs
inferredcites →https://doi.org/10.1016/0012-365x(91)90354-5openalex-snapshot
Hamilton decompositions of cartesian products of graphs
inferredcites →https://doi.org/10.1016/0196-6774(88)90015-6openalex-snapshot
Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
inferredcites →https://doi.org/10.1016/0890-5401(88)90016-8openalex-snapshot
The multi-tree approach to reliability in distributed networks
inferredcites →https://doi.org/10.1016/j.jpdc.2005.05.009openalex-snapshot
Edge-disjoint spanning trees for the generalized butterfly networks and their applications
inferredcites →https://doi.org/10.1016/j.parco.2006.12.001openalex-snapshot
Parallel construction of optimal independent spanning trees on hypercubes
inferredcites →https://doi.org/10.1016/j.tcs.2008.12.042openalex-snapshot
On the independent spanning trees of recursive circulant graphs G(cdm,d) with d>2
inferredcites →https://doi.org/10.1016/s0012-365x(00)00377-0openalex-snapshot
Completely independent spanning trees in the underlying graph of a line digraph
inferredcites →https://doi.org/10.1016/s0020-0190(98)00205-1openalex-snapshot
Independent spanning trees of chordal rings
inferredcites →https://doi.org/10.1016/s0020-0190(99)00033-2openalex-snapshot
On edge-disjoint spanning trees in hypercubes
inferredcites →https://doi.org/10.1016/s0166-218x(00)00269-9openalex-snapshot
Independent spanning trees with small depths in iterated line digraphs
inferredcites →https://doi.org/10.1109/12.485370openalex-snapshot
Edge-disjoint spanning trees on the star network with applications to fault tolerance
inferredcites →https://doi.org/10.1109/tc.2009.98openalex-snapshot
Independent Spanning Trees on Multidimensional Torus Networks
inferredcites →https://doi.org/10.1109/tpds.2003.1189580openalex-snapshot
Constructing edge-disjoint spanning trees in product networks
inferredcites →https://doi.org/10.1137/s0097539703436734openalex-snapshot
Finding Four Independent Trees
inferredcites →https://doi.org/10.1137/s0097539793244198openalex-snapshot
Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
inferredcites →https://doi.org/10.1287/moor.10.4.701openalex-snapshot
A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.21780openalex-snapshot
Dirac's Condition for Completely Independent Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-18126-0_8openalex-snapshot
Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_28openalex-snapshot
Constructing Tri-CISTs in Shuffle-Cubes
inferred← citeshttps://doi.org/10.1007/978-3-030-95391-1_34openalex-snapshot
Completely Independent Spanning Trees in the Line Graphs of Torus Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-09174-7_13openalex-snapshot
Finding Totally Independent Spanning Trees with Linear Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-29516-9_22openalex-snapshot
Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-35452-6_13openalex-snapshot
Completely Independent Spanning Trees on Complete Graphs, Complete Bipartite Graphs and Complete Tripartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-45278-9_19openalex-snapshot
Structural Properties of Subdivided-Line Graphs
inferred← citeshttps://doi.org/10.1007/978-981-13-9190-3_46openalex-snapshot
Designing an Algorithm to Improve the Diameters of Completely Independent Spanning Trees in Crossed Cubes
inferred← citeshttps://doi.org/10.1007/978-981-95-0218-9_2openalex-snapshot
A Sufficient Condition for the Existence of Two Completely Independent Spanning Trees
inferred← citeshttps://doi.org/10.1007/s00373-022-02585-wopenalex-snapshot
Degree Conditions for Completely Independent Spanning Trees of Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00373-023-02622-2openalex-snapshot
Two Completely Independent Spanning Trees of $$P_4$$-Free Graphs
inferred← citeshttps://doi.org/10.1007/s00373-023-02688-yopenalex-snapshot
Completely Independent Spanning Trees in Line Graphs
inferred← citeshttps://doi.org/10.1007/s10878-022-00863-0openalex-snapshot
Constructing tri-CISTs in shuffle-cubes
inferred← citeshttps://doi.org/10.1007/s11227-020-03297-9openalex-snapshot
Constructing dual-CISTs of pancake graphs and performance assessment of protection routings on some Cayley networks
inferred← citeshttps://doi.org/10.1007/s11227-022-04351-4openalex-snapshot
Independent spanning trees in Eisenstein–Jacobi networks
inferred← citeshttps://doi.org/10.1016/j.amc.2019.06.060openalex-snapshot
Constructing dual-CISTs of DCell data center networks
inferred← citeshttps://doi.org/10.1016/j.amc.2020.125900openalex-snapshot
Reliability analysis based on the dual-CIST in shuffle-cubes
inferred← citeshttps://doi.org/10.1016/j.dam.2014.06.002openalex-snapshot
Ore’s condition for completely independent spanning trees
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.007openalex-snapshot
Completely independent spanning trees in some regular graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.11.019openalex-snapshot
Constructing completely independent spanning trees in crossed cubes
inferred← citeshttps://doi.org/10.1016/j.dam.2017.11.018openalex-snapshot
Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees
inferred← citeshttps://doi.org/10.1016/j.dam.2021.08.023openalex-snapshot
New comments on “A Hamilton sufficient condition for completely independent spanning tree”
inferred← citeshttps://doi.org/10.1016/j.dam.2023.07.001openalex-snapshot
Two completely independent spanning trees of split graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.08.020openalex-snapshot
Every 2-connected {claw, Z 2 }-free graph with minimum degree at least 4 contains two CISTs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.08.048openalex-snapshot
The completely independent spanning trees in P 4 -free graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2026.05.028openalex-snapshot
Completely independent spanning trees in split graphs: Structural properties and complexity
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113080openalex-snapshot
Two completely independent spanning trees of claw-free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115455openalex-snapshot
Completely independent spanning trees and spectral radii of graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2020.05.048openalex-snapshot
Three completely independent spanning trees of crossed cubes with application to secure-protection routing
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.05.004openalex-snapshot
Degree condition for completely independent spanning trees
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.09.006openalex-snapshot
Improving the diameters of completely independent spanning trees in locally twisted cubes
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.105874openalex-snapshot
A well-equalized 3-CIST partition of alternating group graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2015.01.008openalex-snapshot
Structural properties of subdivided-line graphs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.06.018openalex-snapshot
Node-independent spanning trees in Gaussian networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2018.08.006openalex-snapshot
Constructing spanning trees in augmented cubes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.02.007openalex-snapshot
A protection routing with secure mechanism in Möbius cubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.08.024openalex-snapshot
Constructing two completely independent spanning trees in hypercube-variant networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.03.035openalex-snapshot
A two-stages tree-searching algorithm for finding three completely independent spanning trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115718openalex-snapshot
Fan-type condition for two completely independent spanning trees
inferred← citeshttps://doi.org/10.1109/cscloud.2015.13openalex-snapshot
A Reliable Broadcasting Algorithm in Locally Twisted Cubes
inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2019.00189openalex-snapshot
Three Completely Independent Spanning Trees of Crossed Cubes with Application to Secure-Protection Routing
inferred← citeshttps://doi.org/10.1109/iccsn.2017.8230281openalex-snapshot
Toward the completely independent spanning trees problem on BCube
inferred← citeshttps://doi.org/10.1109/iccworkshops67674.2025.11162431openalex-snapshot
A Reliable Network Coverage Using Different Spanning Trees in Hexagonal Networks
inferred← citeshttps://doi.org/10.1109/tc.2025.3547161openalex-snapshot
Reliable Communication Scheme Based on Completely Independent Spanning Trees in Data Center Networks
inferred← citeshttps://doi.org/10.1109/tnet.2019.2910019openalex-snapshot
Dual-CISTs: Configuring a Protection Routing on Some Cayley Networks
inferred← citeshttps://doi.org/10.1109/tnse.2022.3205706openalex-snapshot
A High-Performantal and Server-Centric Based Data Center Network
inferred← citeshttps://doi.org/10.1109/tpds.2019.2931904openalex-snapshot
The Existence of Completely Independent Spanning Trees for Some Compound Graphs
inferred← citeshttps://doi.org/10.1109/tpds.2020.3029654openalex-snapshot
Constructing Completely Independent Spanning Trees in Data Center Network Based on Augmented Cube
inferred← citeshttps://doi.org/10.1109/tpds.2021.3132412openalex-snapshot
Construction of Dual-CISTs on an Infinite Class of Networks
inferred← citeshttps://doi.org/10.1109/tpds.2021.3133595openalex-snapshot
Completely Independent Spanning Trees on BCCC Data Center Networks With an Application to Fault-Tolerant Routing
inferred← citeshttps://doi.org/10.1109/wimob.2017.8115791openalex-snapshot
Completely independent spanning trees for enhancing the robustness in ad-hoc Networks
inferred← citeshttps://doi.org/10.1142/s0129054125500078openalex-snapshot
An Innovative Algorithm for Generating Three Completely Independent Spanning Trees in Folded Hypercube Networks
inferred← citeshttps://doi.org/10.1145/3591110openalex-snapshot
Independent Spanning Trees in Networks: A Survey
inferred← citeshttps://doi.org/10.1371/journal.pone.0155580openalex-snapshot
Reducing the Spectral Radius of a Torus Network by Link Removal
inferred← citeshttps://doi.org/10.15379/ijmst.v10i2.2781openalex-snapshot
Fault Tolerance and Node Mapping Algorithm Hierarchical Graph HCN
inferred← citeshttps://doi.org/10.1587/transfun.e100.a.1932openalex-snapshot
Completely Independent Spanning Trees on 4-Regular Chordal Rings
inferred← citeshttps://doi.org/10.1587/transfun.e98.a.2191openalex-snapshot
A Note on the Degree Condition of Completely Independent Spanning Trees
inferred← citeshttps://doi.org/10.1587/transinf.2014edl8079openalex-snapshot
Completely Independent Spanning Trees on Some Interconnection Networks
inferred← citeshttps://doi.org/10.1587/transinf.2019pal0001openalex-snapshot
Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes
inferred← citeshttps://doi.org/10.2139/ssrn.7583657openalex-snapshot
Minimum-weight pairs of completely independent spanning trees in complete graphs
inferred← citeshttps://doi.org/10.3390/math11143255openalex-snapshot
Dual Protection Routing Trees on Graphs
inferred← citeshttps://doi.org/10.3934/math.2023823openalex-snapshot
Completely independent spanning trees in some Cartesian product graphs
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2014.73openalex-snapshot
Connecting Vertices by Independent Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1705.01358openalex-snapshot
Construction of Four Completely Independent Spanning Trees on Augmented Cubes
inferred← citeshttps://doi.org/10.70675/b3362be4z6aaaz4470z925az7ce98e5291d1openalex-snapshot
Définition d'une architecture IoT sécurisée et adaptative basée sur la blockchain
inferred← citeshttps://doi.org/10.7151/dmgt.1806openalex-snapshot
Completely independent spanning trees in (partial) k-trees
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.