Optimal segmentation of graphs with exclusive OR nodes

DOI10.1016/S0307-904X(81)80071-6zbMath0464.68063OpenAlexW2063326602MaRDI QIDQ1154276

Amiya K. Chakravarty

Publication date: 1981

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0307-904x(81)80071-6

zbMATH Keywords

directed acyclic graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Theory of software (68N99)

Cites Work

• Branch-and-Bound Strategies for Dynamic Programming
• Automatic segmentation of cyclic program structures based on connectivity and processor timing
• Unnamed Item

This page was built for publication: Optimal segmentation of graphs with exclusive OR nodes