Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs

DOI10.1016/j.ipl.2010.11.018zbMath1260.68293OpenAlexW2076162361MaRDI QIDQ1944080

Xie-Bin Chen

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.11.018

zbMATH Keywords

parallel algorithmsCartesian productindependent spanning treesfault-tolerant broadcastinggeneralized base-b hypercube

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Construction independent spanning trees on locally twisted cubes in parallel ⋮ Construction of optimal independent spanning trees on folded hypercubes

Cites Work

• Unnamed Item
• Independent spanning trees of chordal rings
• Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
• Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
• The pancyclicity and the Hamiltonian-connectivity of the generalized base-\(b\) hypercube
• Constructing edge-disjoint spanning trees in locally twisted cubes
• On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
• The multi-tree approach to reliability in distributed networks
• Independent trees in planar graphs
• Reliable broadcasting in product networks
• Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs.
• Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
• Constructing edge-disjoint spanning trees in twisted cubes
• Three tree-paths
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
• CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2)
• Independent Spanning Trees on Multidimensional Torus Networks
• Finding Four Independent Trees

This page was built for publication: Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs