Combinatorial problems in the theory of complexity of algorithmic nets without cycles for simple computers
Karel Čulík (1971)
Aplikace matematiky
Similarity:
Displaying similar documents to “Generalized ternary simulation of sequential circuits”
Combinatorial problems in the theory of complexity of algorithmic nets without cycles for simple computers
Non-planar network with edges subject to failure and enumeration of proper cuts
P. J. Doulliez, M. R. Rao (1973)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Avoiding Unstructured Workflows in Prerequisites Modeling
Boris Milašinović, Krešimir Fertalj (2012)
Computer Science and Information Systems
Similarity:
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:
Convex Polyhedra With Triangular Faces and Cone Triangulation
Milica Stojanović, Milica Vučković (2011)
The Yugoslav Journal of Operations Research
Similarity:
A Technique for Improving Readability of Forrester Diagram in System Dynamics
Wei-Tzen Yang, Nai-Wen Kuo (2003)
The Yugoslav Journal of Operations Research
Similarity:
Syntactical definitions of program and flow diagram
Karel Čulík (1973)
Aplikace matematiky
Similarity:
A comparison of three algorithms for reducing the profile of a sparse matrix
Alain Billionnet, Jean-François Brêteau (1989)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Even kernels.
Fraenkel, Aviezri (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity: