scientific article; zbMATH DE number 3876615

MaRDI QIDQ3341920zbMATH OpenFDO

Authors Sandra M. Hedetniemi, Stephen T. Hedetniemi

Publication date 1983

zbMATH Keywords

algorithmscentroiddiameterdomination numberfamily representation of a treeimplicit data structure for treesindependence numberspace and time requirements

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Recommendations

• scientific article; zbMATH DE number 4205968
• scientific article; zbMATH DE number 3990869
• scientific article; zbMATH DE number 1145903
• Representing trees of higher degree
• Fully-functional succinct trees

Cited in

(6)

• Controlling the data space of tree structured computations
• A new approach to operating with undirected trees
• Space saving by dynamic algebraization based on tree-depth
• scientific article; zbMATH DE number 4205968 (Why is no real title available?)
• scientific article; zbMATH DE number 3907783 (Why is no real title available?)
• Minimizing access pointers into trees and arrays

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