Compiler techniques for flat neighborhood networks

MaRDI QIDQ4406692zbMATH OpenFDO

Authors Henry G. Dietz, T. I. Mattox

Publication date 26 June 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2017/20170244.htm

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Computing methodologies and applications (68U99)

Recommendations

• Compact routing for flat networks
• Comparative analysis of topological constructions of sparse flat neighborhood networks for cluster supercomputers
• Graph layout for applications in compiler construction
• The neighbor-net algorithm
• Flattening of generalized algebraic high-level nets.
• An algorithmic toolbox for network calculus
• Computing relative neighbourhood graphs in the plane

Cited in

(2)

• Comparative analysis of topological constructions of sparse flat neighborhood networks for cluster supercomputers
• scientific article; zbMATH DE number 1751346 (Why is no real title available?)

This page was built for publication: Compiler techniques for flat neighborhood networks

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