scientific article; zbMATH DE number 3557197
From MaRDI portal
Publication:4133096
zbMath0357.68017MaRDI QIDQ4133096
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (5)
A strong-connectivity algorithm and its applications in data flow analysis ⋮ Pathlistings applied to data flow analysis ⋮ Lower bounds on the lengths of node sequences in directed graphs ⋮ Node listings for reducible flow graphs ⋮ Slicing communicating automata specifications: Polynomial algorithms for model reduction
This page was built for publication: