Reduction of Average Path Length in Binary Decision Diagrams by Spectral Methods

DOI10.1109/TC.2007.70811zbMATH Open1373.68198OpenAlexW2157547070MaRDI QIDQ4589565FDOQ4589565

Osnat Keren

Publication date: 10 November 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cited In (3)

• Performance assessment and reliability analysis of dependable and distributed computing systems based on BDD and recursive merge
• Optimization of the critical diameter and average path length of social networks
• Network structure optimization for social networks by minimizing the average path length

This page was built for publication: Reduction of Average Path Length in Binary Decision Diagrams by Spectral Methods

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