Independent spanning trees on even networks

DOI10.1016/J.INS.2011.02.012zbMATH Open1218.68109OpenAlexW2094474414MaRDI QIDQ545379FDOQ545379

Authors: Jong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, L. Lipták 

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

Recommendations

• Completely independent spanning trees in some regular graphs
• Completely independent spanning trees in torus networks
• Completely independent spanning trees in line graphs
• Constructing independent spanning trees on bubble-sort networks
• Two completely independent spanning trees of split graphs
• Independent Spanning Trees on Multidimensional Torus Networks
• Constructing two completely independent spanning trees in hypercube-variant networks
• Independent spanning trees on twisted cubes
• Constructing independent spanning trees in alternating group networks

zbMATH Keywords

algorithmsindependent spanning treeseven networksinternally disjoint paths

Mathematics Subject Classification ID

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

Cites Work

• Many-to-many disjoint paths in faulty hypercubes
• Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
• Title not available (Why is that?)
• A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS
• The multi-tree approach to reliability in distributed networks
• Independent trees in graphs
• Independent spanning trees of chordal rings
• Three tree-paths
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Title not available (Why is that?)
• Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
• Independent spanning trees with small depths in iterated line digraphs
• Independent trees in planar graphs
• Long paths and cycles in hypercubes with faulty vertices
• Independent Spanning Trees on Multidimensional Torus Networks
• Finding Four Independent Trees
• 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\)
• Reliable broadcasting in product networks
• CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2)
• Packing Spanning Trees

Cited In (12)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545379)