scientific article; zbMATH DE number 15358

MaRDI QIDQ3972002zbMATH OpenFDO

Authors Norbert Grünwald

Publication date 25 June 1992

zbMATH Keywords

binary treesedge-numbering

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• scientific article; zbMATH DE number 7531
• Publication:4886041
• Optimal edge ranking of trees in linear time
• scientific article; zbMATH DE number 4047157
• scientific article; zbMATH DE number 437538

Cited in

(5)

• Optimal binary trees with order constraints
• Optimal Numberings of an $N \times N$ Array
• New results on edge-bandwidth
• scientific article; zbMATH DE number 4047157 (Why is no real title available?)
• On the maximum edge length in VLSI layouts of complete binary trees

This page was built for publication:

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