An algorithm to find \(k\)-tight optimal double-loop networks.

zbMATH Open1249.05371MaRDI QIDQ2881275

Jianqin Zhou

Publication date: 3 April 2012

Published in: Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

double-loop network\(L\)-shaped tile\(k\)-tight optimal

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Title not available (Why is that?)

This page was built for publication: An algorithm to find \(k\)-tight optimal double-loop networks.

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