Using Double-Loop digraphs for solving Frobenius' Problems

DOI10.1016/J.ENDM.2006.06.004MaRDI QIDQ3439408zbMATH OpenOpenAlexFDO

Authors

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2006.06.004

zbMATH Keywords

border setdouble-loop digraphFrobeniusminimum distance diagram

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Linear Diophantine equations (11D04)

Recommendations

• Some contributions to the Frobenius' Problem
• Sets of Gaps in Sequences of Frobenius' Problems with 3 Elements
• Frobenius' problem
• A note on a special case of the Frobenius problem
• scientific article; zbMATH DE number 3176160

Cites work

• An efficient algorithm to find optimal double loop networks
• Faster algorithms for Frobenius numbers

Cited in

(3)

• Some contributions to the Frobenius' Problem
• Sets of Gaps in Sequences of Frobenius' Problems with 3 Elements
• Classification of numerical 3-semigroups by means of L-shapes.

This page was built for publication: Using Double-Loop digraphs for solving Frobenius' Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439408)