Clustering a DAG for CAD databases

DOI10.1109/32.9055MaRDI QIDQ3813335zbMATH OpenOpenAlexFDO

Authors

Publication date 1988

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/32.9055

zbMATH Keywords

breadth-first traversalsCAD databaseschildren-depth-first traversaldesign hierarchydirected acyclic graphstorage organization

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99)

Recommendations

• Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications
• Navigating Clustered Graphs Using Force-Directed Methods
• Drawing directed acyclic graphs: an experimental study
• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• Efficient coding of labeled directed acyclic graphs

Cited in

(4)

• On the number of descendants in an object DAG
• Graph indexing for spatial data traversal in road map databases
• Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications
• An update algorithm for restricted random walk clustering for dynamic data sets

This page was built for publication: Clustering a DAG for CAD databases

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