Pages that link to "Item:Q1842140"
From MaRDI portal
The following pages link to An efficient algorithm to find optimal double loop networks (Q1842140):
Displaying 12 items.
- A symbolical algorithm on additive basis and double-loop networks (Q596074) (← links)
- Procreating tiles of double commutative-step digraphs (Q942869) (← links)
- Improved upper and lower bounds on the optimization of mixed chordal ring networks (Q989480) (← links)
- Triple-loop networks with arbitrarily many minimum distance diagrams (Q1024484) (← links)
- New dense families of triple loop networks (Q1292809) (← links)
- Triple loop networks with small transmission delay (Q1356442) (← links)
- Fault-tolerant routings in double fixed-step networks (Q1377656) (← links)
- A simple algorithm to find the steps of double-loop networks (Q1613389) (← links)
- An efficient algorithm to find optimal double loop networks (Q1842140) (← links)
- An efficient algorithm to find a double-loop network that realizes a given L-shape (Q2503285) (← links)
- Using Double-Loop digraphs for solving Frobenius' Problems (Q3439408) (← links)
- Some contributions to the Frobenius' Problem (Q3439566) (← links)
