Combinatorial problems in the theory of complexity of algorithmic nets without cycles for simple computers
Karel Čulík (1971)
Aplikace matematiky
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Syntactical definitions of program and flow diagram”
Combinatorial problems in the theory of complexity of algorithmic nets without cycles for simple computers
Optimal sequential and parallel algorithms for cut vertices and bridges on trapezoid graphs.
Chen, Hon-Chan (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Avoiding Unstructured Workflows in Prerequisites Modeling
Boris Milašinović, Krešimir Fertalj (2012)
Computer Science and Information Systems
Similarity:
Neighbourhood tournaments
Bohdan Zelinka (1986)
Mathematica Slovaca
Similarity: