Branch distance optimization of structured programs

DOI10.1016/0898-1221(90)90251-EzbMath0728.68035OpenAlexW2053193812MaRDI QIDQ805220

N. E. Zubov

Publication date: 1990

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(90)90251-e

zbMATH Keywords

NP-hardbranch-and-bound methodcode generationbranch distance optimizationoptimal linear arrangement problemstructured programs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01)

Uses Software

• LOLIB

Cites Work

• Some simplified NP-complete graph problems
• Code Generation and Storage Allocation for Machines with Span-Dependent Instructions
• Chaining Span-Dependent Jump Instructions
• Algorithms for Scheduling Independent Tasks
• Assembling code for machines with span-dependent instructions
• Unnamed Item
• Unnamed Item

This page was built for publication: Branch distance optimization of structured programs