Back to Search
Start Over
Algebraic and graph theoretic characterizations of structured flowchart schemes
- Source :
- Theoretical Computer Science. 9:265-286
- Publication Year :
- 1979
- Publisher :
- Elsevier BV, 1979.
-
Abstract
- The paper concerns the relationship between graph theoretic and algebraic properties of structured flowchart schemes. For each of ten classes of flowchart schemes defined algebraically, a graph theoretic property is given which characterizes this class. The classes include the Dijkstra schemes, Elgot's CACI and G -schemes, the reducible schemes and Kosaraju's BJn-schemes. For two classes of schemes defined by a graph theoretic property, an equivalent algebraic characterization is found.
- Subjects :
- Discrete mathematics
Algebraic properties
Class (set theory)
Flowchart
Property (philosophy)
General Computer Science
Graph theoretic
Characterization (mathematics)
Theoretical Computer Science
law.invention
law
Computer Science::Programming Languages
Algebraic number
Dijkstra's algorithm
Computer Science(all)
Mathematics
Subjects
Details
- ISSN :
- 03043975
- Volume :
- 9
- Database :
- OpenAIRE
- Journal :
- Theoretical Computer Science
- Accession number :
- edsair.doi.dedup.....2cc9b1a9f134895edd0f49354f91680d