Single-row transformation of complete graphs

DOI10.1007/S11227-005-0184-4MaRDI QIDQ1777610zbMATH OpenOpenAlexFDO

Authors Shaharuddin Salleh, Stephan Olariu, Mohd Ismail Abd Aziz, Bahrom B. Sanugi

Publication date 24 May 2005

Published in The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11227-005-0184-4

zbMATH Keywords

VLSI designfully-connected graphwireless cellular telephone networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 140495
• The complexity of single row routing
• On optimum single-row routing
• scientific article; zbMATH DE number 97100
• VLSI layouts of complete graphs and star graphs

Cited in

(2)

• Algebraic approach to single-pushout graph transformation
• Partitioning technique for transforming perfect binary trees into single-row networks

This page was built for publication: Single-row transformation of complete graphs

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