Independent spanning trees on even networks

DOI10.1016/J.INS.2011.02.012MaRDI QIDQ545379zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 1696542 (Why is no real title available?)
• scientific article; zbMATH DE number 1322340 (Why is no real title available?)
• A linear-time algorithm to find four independent spanning trees in four connected planar graphs
• CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2)
• Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
• Finding Four Independent Trees
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Improving bounds on link failure tolerance of the star graph
• Independent Spanning Trees on Multidimensional Torus Networks
• Independent spanning trees of chordal rings
• Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
• Independent spanning trees with small depths in iterated line digraphs
• Independent trees in graphs
• Independent trees in planar graphs
• Long paths and cycles in hypercubes with faulty vertices
• Many-to-many disjoint paths in faulty hypercubes
• On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
• Packing Spanning Trees
• Reliable broadcasting in product networks
• Substar reliability analysis in star networks
• The multi-tree approach to reliability in distributed networks
• Three tree-paths

Cited in

(16)

• 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
• Completely independent spanning trees in some regular graphs
• Independent spanning trees in crossed cubes
• A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks
• Construction independent spanning trees on locally twisted cubes in parallel
• Constructing node-independent spanning trees in augmented cubes
• Independent spanning trees on folded hyper-stars
• An improved algorithm to construct edge-independent spanning trees in augmented cubes
• Constructing independent spanning trees on bubble-sort networks
• Modelling simultaneous broadcasting by level-disjoint partitions
• Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks
• Construction of optimal independent spanning trees on folded hypercubes
• Linear time algorithms for finding independent spanning trees on pyramid networks
• 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)