Introduces multi-orientation edge-minimum repair (MOEM) for non-redundant fault-tolerant one-to-all broadcast in dense Gaussian networks generated by α=k+(k+1)i, proving use of c-1 repair edges and depth at most k+2 for one or two faults.
One-to-many node-disjoint paths routing in dense Gaussian networks,
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.DC 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
Presents O(1)-time certificate selectors for repairing source-centered broadcast trees after at most two faults in dense Gaussian G_k and EJ H_t networks, guaranteeing depth bounds and exactly c-1 repair edges, with exhaustive validation showing zero failures.
A partitioning-and-rotation construction yields two CISTs in dense Gaussian networks with at least 33% lower average maximum delivery steps than prior methods.
citing papers explorer
-
Multi-Orientation Edge-Minimum Repair for Non-Redundant Fault-Tolerant Broadcasting in Dense Gaussian Networks
Introduces multi-orientation edge-minimum repair (MOEM) for non-redundant fault-tolerant one-to-all broadcast in dense Gaussian networks generated by α=k+(k+1)i, proving use of c-1 repair edges and depth at most k+2 for one or two faults.
-
Constant-Time Certificate Selection for Local Broadcast Repair in Dense Gaussian and Eisenstein--Jacobi Networks
Presents O(1)-time certificate selectors for repairing source-centered broadcast trees after at most two faults in dense Gaussian G_k and EJ H_t networks, guaranteeing depth bounds and exactly c-1 repair edges, with exhaustive validation showing zero failures.
-
An Efficient Construction of Completely Independent Spanning Trees in Dense Gaussian Networks
A partitioning-and-rotation construction yields two CISTs in dense Gaussian networks with at least 33% lower average maximum delivery steps than prior methods.