A symbolical algorithm on additive basis and double-loop networks

DOI10.1016/j.tcs.2004.02.006zbMath1060.05087OpenAlexW2053352083MaRDI QIDQ596074

Daniel Arteaga, I. Diego, Francesc Aguiló

Publication date: 10 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.02.006

zbMATH Keywords

algorithmsbounddouble-loop digraphSmith normal form

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Some contributions to the Frobenius' Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Double commutative-step digraphs with minimum diameters
• An efficient algorithm to find optimal double loop networks
• Optimal double-loop networks with non-unit steps
• Diameters of weighted double loop networks
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Extremal Problems in the Construction of Distributed Loop Networks
• Reaching fault diagnosis agreement under a hybrid fault model

This page was built for publication: A symbolical algorithm on additive basis and double-loop networks