Independent spanning trees on even networks

DOI10.1016/j.ins.2011.02.012zbMath1218.68109OpenAlexW2094474414MaRDI QIDQ545379

Eddie Cheng, László Lipták, Jong-Seok Kim, Hyeong-Ok Lee

Publication date: 22 June 2011

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2011.02.012

zbMATH Keywords

algorithmsindependent spanning treeseven networksinternally disjoint paths

Mathematics Subject Classification ID

Trees (05C05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (10)

Construction independent spanning trees on locally twisted cubes in parallel ⋮ An algorithm to construct independent spanning trees on parity cubes ⋮ A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees ⋮ Construction of optimal independent spanning trees on folded hypercubes ⋮ Edge-independent spanning trees in augmented cubes ⋮ Modelling simultaneous broadcasting by level-disjoint partitions ⋮ An improved algorithm to construct edge-independent spanning trees in augmented cubes ⋮ Constructing Node-Independent Spanning Trees in Augmented Cubes ⋮ A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks ⋮ Independent spanning trees in crossed cubes

Cites Work

• Unnamed Item
• Unnamed Item
• Independent spanning trees of chordal rings
• Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
• Long paths and cycles in hypercubes with faulty vertices
• Many-to-many disjoint paths in faulty hypercubes
• Substar reliability analysis in star networks
• Improving bounds on link failure tolerance of the star graph
• 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
• Independent trees in graphs
• Reliable broadcasting in product networks
• 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
• Packing Spanning Trees
• CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2)
• A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS
• Independent Spanning Trees on Multidimensional Torus Networks
• Finding Four Independent Trees
• Independent spanning trees with small depths in iterated line digraphs

This page was built for publication: Independent spanning trees on even networks