scientific article; zbMATH DE number 1101606

MaRDI QIDQ4371028zbMATH OpenFDO

Authors Günter Hotz, Hongzhong Wu

Publication date 7 January 1998

zbMATH Keywords

algorithmsarrangement complexityoptimal test settree-like structured VLSI systemuniform tree

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• scientific article; zbMATH DE number 1263307
• On optimal linear arrangements of trees
• Linear arrangement problems on recursively partitioned graphs
• scientific article; zbMATH DE number 4078801
• Tree enumeration and tree algorithm complexity computation

Cited in

(4)

• Finding the seed of uniform attachment trees
• scientific article; zbMATH DE number 6680130 (Why is no real title available?)
• Uniforming n-place functions on ds(alpha)
• scientific article; zbMATH DE number 1263307 (Why is no real title available?)

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 Q4371028)