scientific article; zbMATH DE number 1953097
From MaRDI portal
Publication:4414501
zbMath1022.68600MaRDI QIDQ4414501
Publication date: 25 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2573/25730235.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (32)
Improving the diameters of completely independent spanning trees in locally twisted cubes ⋮ Degree condition for completely independent spanning trees ⋮ A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks ⋮ Completely independent spanning trees in \(k\)-th power of graphs ⋮ Constructing two completely independent spanning trees in hypercube-variant networks ⋮ Finding Totally Independent Spanning Trees with Linear Integer Programming ⋮ An efficient parallel construction of optimal independent spanning trees on hypercubes ⋮ A Hamilton sufficient condition for completely independent spanning tree ⋮ Ore's condition for completely independent spanning trees ⋮ Two counterexamples on completely independent spanning trees ⋮ Comments on: ``A Hamilton sufficient condition for completely independent spanning tree ⋮ Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees ⋮ Completely independent spanning trees in line graphs ⋮ Sufficient conditions for protection routing in IP networks ⋮ Constructing dual-CISTs of folded divide-and-swap cubes ⋮ New comments on ``A Hamilton sufficient condition for completely independent spanning tree ⋮ Constructing completely independent spanning trees in crossed cubes ⋮ Reliability analysis based on the dual-CIST in shuffle-cubes ⋮ Completely independent spanning trees in torus networks ⋮ Parallel construction of multiple independent spanning trees on highly scalable datacenter networks ⋮ Completely independent spanning trees in some regular graphs ⋮ Structural properties of subdivided-line graphs ⋮ A well-equalized 3-CIST partition of alternating group graphs ⋮ Constructing dual-CISTs of DCell data center networks ⋮ Completely independent spanning trees in (partial) \(k\)-trees ⋮ Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes ⋮ Constructing tri-CISTs in shuffle-cubes ⋮ Constructing tri-CISTs in shuffle-cubes ⋮ Three completely independent spanning trees of crossed cubes with application to secure-protection routing ⋮ A two-stages tree-searching algorithm for finding three completely independent spanning trees ⋮ Degree conditions for completely independent spanning trees of bipartite graphs ⋮ Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)
This page was built for publication:
