A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks (Q2110363): Difference between revisions

Latest revision as of 04:22, 31 July 2024

scientific article

Language	Label	Description	Also known as
English	A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks	scientific article

Statements

instance of

scholarly article

0 references

title

A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks (English)

0 references

0 references

0 references

0 references

0 references

0 references

Theoretical Computer Science

0 references

publication date

21 December 2022

0 references

zbMATH Keywords

conditional bijective connection networks

0 references

edge independent spanning trees

0 references

line graph

0 references

data center network

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2022.11.023

0 references

cites work

The multi-tree approach to reliability in distributed networks

0 references

Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security

0 references

Four Edge-Independent Spanning Trees

0 references

Independent trees in planar graphs

0 references

Three tree-paths

0 references

Independent spanning trees in crossed cubes

0 references

Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes

0 references

On Data Center Network Architectures for Interconnecting Dual-Port Servers

0 references

Treewidth of the Line Graph of a Complete Graph

0 references

Reliable broadcasting in product networks

0 references

A note on edge-disjoint Hamilton cycles in line graphs

0 references

An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges

0 references

Efficient unicast in bijective connection networks with the restricted faulty node set

0 references

Independent spanning trees on even networks

0 references

Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes

0 references

Broadcasting secure messages via optimal independent spanning trees in folded hypercubes

0 references

A comment on ``Independent spanning trees in crossed cubes''

0 references

Parallel construction of multiple independent spanning trees on highly scalable datacenter networks

0 references

Constructing edge-disjoint spanning trees in locally twisted cubes

0 references

Structural properties of subdivided-line graphs

0 references

Construction independent spanning trees on locally twisted cubes in parallel

0 references

Independent spanning trees on twisted cubes

0 references

Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networks

0 references

Identifiers

DOI

10.1016/j.tcs.2022.11.023

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2110363

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2022.11.023
+Normal rank
@@ Property / OpenAlex ID @@
+W4309942225
@@ Property / OpenAlex ID: W4309942225 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q123330108
@@ Property / Wikidata QID: Q123330108 / rank @@
+Normal rank
@@ Property / cites work @@
+The multi-tree approach to reliability in distributed networks
+Normal rank
@@ Property / cites work @@
+Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
+Normal rank
@@ Property / cites work @@
+Four Edge-Independent Spanning Trees
@@ Property / cites work: Four Edge-Independent Spanning Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Independent trees in planar graphs
@@ Property / cites work: Independent trees in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Three tree-paths
@@ Property / cites work: Three tree-paths / rank @@
+Normal rank
@@ Property / cites work @@
+Independent spanning trees in crossed cubes
@@ Property / cites work: Independent spanning trees in crossed cubes / rank @@
+Normal rank
@@ Property / cites work @@
+Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
+Normal rank
@@ Property / cites work @@
+On Data Center Network Architectures for Interconnecting Dual-Port Servers
+Normal rank
@@ Property / cites work @@
+Treewidth of the Line Graph of a Complete Graph
@@ Property / cites work: Treewidth of the Line Graph of a Complete Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Reliable broadcasting in product networks
@@ Property / cites work: Reliable broadcasting in product networks / rank @@
+Normal rank
@@ Property / cites work @@
+A note on edge-disjoint Hamilton cycles in line graphs
+Normal rank
@@ Property / cites work @@
+An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
+Normal rank
@@ Property / cites work @@
+Efficient unicast in bijective connection networks with the restricted faulty node set
+Normal rank
@@ Property / cites work @@
+Independent spanning trees on even networks
@@ Property / cites work: Independent spanning trees on even networks / rank @@
+Normal rank
@@ Property / cites work @@
+Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
+Normal rank
@@ Property / cites work @@
+Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
+Normal rank
@@ Property / cites work @@
+A comment on ``Independent spanning trees in crossed cubes''
+Normal rank
@@ Property / cites work @@
+Parallel construction of multiple independent spanning trees on highly scalable datacenter networks
+Normal rank
@@ Property / cites work @@
+Constructing edge-disjoint spanning trees in locally twisted cubes
+Normal rank
@@ Property / cites work @@
+Structural properties of subdivided-line graphs
@@ Property / cites work: Structural properties of subdivided-line graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Construction independent spanning trees on locally twisted cubes in parallel
+Normal rank
@@ Property / cites work @@
+Independent spanning trees on twisted cubes
@@ Property / cites work: Independent spanning trees on twisted cubes / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networks
+Normal rank