Using Double-Loop digraphs for solving Frobenius' Problems

DOI10.1016/j.endm.2006.06.004zbMath1201.05041OpenAlexW2055270150MaRDI QIDQ3439408

No author found.

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

double-loop digraphFrobeniusminimum distance diagramborder set

Mathematics Subject Classification ID

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

Related Items (1)

Classification of numerical 3-semigroups by means of L-shapes.

Cites Work

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

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