Three tree-paths
From MaRDI portal
Publication:3475297
DOI10.1002/jgt.3190130205zbMath0698.05049OpenAlexW2079000395MaRDI QIDQ3475297
Publication date: 1989
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190130205
Trees (05C05) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Related Items (39)
Construction independent spanning trees on locally twisted cubes in parallel ⋮ Independent spanning trees of chordal rings ⋮ Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity ⋮ A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks ⋮ Unnamed Item ⋮ Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits ⋮ An algorithm to construct independent spanning trees on parity cubes ⋮ Reliable broadcasting in product networks ⋮ A comment on ``Independent spanning trees in crossed cubes ⋮ Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs ⋮ Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes ⋮ Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes ⋮ Spanning trees: A survey ⋮ Independent spanning trees on twisted cubes ⋮ A fast parallel algorithm for constructing independent spanning trees on parity cubes ⋮ Construction of optimal independent spanning trees on folded hypercubes ⋮ A parallel algorithm for constructing independent spanning trees in twisted cubes ⋮ Completely independent spanning trees in torus networks ⋮ Parallel construction of multiple independent spanning trees on highly scalable datacenter networks ⋮ On independent spanning trees ⋮ Independent tree spanners: Fault-tolerant spanning trees with constant distance guarantees ⋮ Constructing independent spanning trees for locally twisted cubes ⋮ Independent spanning trees on even networks ⋮ Independent spanning trees with small depths in iterated line digraphs ⋮ Structural properties of subdivided-line graphs ⋮ CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2m, 2) ⋮ Broadcasting secure messages via optimal independent spanning trees in folded hypercubes ⋮ Power assignment for \(k\)-connectivity in wireless ad hoc networks ⋮ Independent spanning trees on folded hyper-stars ⋮ On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) ⋮ An improved algorithm to construct edge-independent spanning trees in augmented cubes ⋮ Mondshein Sequences (a.k.a. (2,1)-Orders) ⋮ Constructing Node-Independent Spanning Trees in Augmented Cubes ⋮ A multi-tree routing scheme using acyclic orientations ⋮ Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks ⋮ A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS ⋮ Four Edge-Independent Spanning 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
Cites Work
This page was built for publication: Three tree-paths
