Entry Bloom:1979:AGT from tcs1975.bib
Last update: Thu Sep 27 02:46:39 MDT 2018
              
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
Y |
Z
BibTeX entry
@Article{Bloom:1979:AGT,
  author =       "S. L. Bloom and R. Tendell",
  title =        "Algebraic and graph theoretic characterizations of
                 structured flowchart schemes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "9",
  number =       "2",
  pages =        "265--286",
  month =        oct,
  year =         "1979",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:36:07 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1975.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C6110 (Systems
                 analysis and programming)",
  corpsource =   "Dept. of Pure and Appl. Math., Stevens Inst. of
                 Technol., Hoboken, NJ, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic characterisations; Dijkstra schemes; Elgot's
                 CACI; flowcharting; graph theoretic characterizations;
                 graph theory; reducible schemes; structured flowchart",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}
Related entries
- algebraic,
1(3)199,
2(1)97,
2(2)209,
3(2)267,
4(1)59,
6(3)255,
8(1)89,
8(3)293,
8(3)359,
9(1)39
 
- analysis,
1(1)21,
3(2)261,
3(3)321,
4(2)155
 
- C1160,
1(2)185,
1(3)237,
2(3)305,
2(3)339,
3(1)51,
3(3)371,
4(2)125,
4(2)137,
4(2)155,
4(3)277,
5(1)51,
5(2)179,
5(3)257,
6(1)93,
6(3)281,
7(2)217,
8(1)13,
8(1)45
 
- characterization,
2(1)45,
2(3)323,
3(1)61,
5(3)325,
8(3)325
 
- combinatorial,
1(2)95,
1(2)185,
1(3)237,
2(3)305,
2(3)339,
3(1)51,
3(2)183,
3(3)371,
4(2)125,
4(2)137,
4(2)155,
4(3)277,
5(1)51,
5(2)179,
5(3)257,
6(1)93,
6(3)281,
7(2)217,
7(3)325,
8(1)13,
8(1)45
 
- Dijkstra,
4(1)59
 
- flowchart,
8(3)325
 
- graph,
1(3)237,
2(3)305,
2(3)339,
3(3)371,
4(3)277,
5(1)51,
6(1)93,
6(3)281
 
- mathematics,
1(2)185,
1(3)237,
2(1)9,
2(3)305,
2(3)339,
3(1)51,
3(3)371,
4(2)125,
4(2)137,
4(2)155,
4(3)277,
5(1)51,
5(2)179,
5(2)211,
5(3)257,
6(1)69,
6(1)93,
6(3)255,
6(3)281,
7(1)25,
7(1)117,
7(2)217,
7(3)325,
8(1)13,
8(1)45,
9(1)27,
9(1)99
 
- programming,
1(1)13,
1(1)21,
1(2)103,
1(2)125,
1(3)193,
1(3)215,
1(4)269,
1(4)289,
2(1)73,
2(2)133,
2(2)183,
2(2)228,
3(2)267,
3(3)349,
4(1)1,
4(1)59,
4(2)155,
4(2)171,
5(1)25,
5(2)113,
5(2)135,
5(2)205,
5(3)223,
5(3)275,
6(1)41,
6(1)93,
6(2)109,
6(2)223,
6(3)233,
6(3)281,
6(3)317,
7(1)79,
7(1)99,
7(3)239,
7(3)273,
8(1)57,
8(1)73,
8(3)325,
8(3)379,
9(1)39,
9(1)83,
9(1)127,
9(2)153,
9(2)243,
9(2)329,
9(2)347
 
- reducible,
8(3)325
 
- schemes,
1(4)297,
2(1)115,
6(3)255,
7(1)25,
8(3)325,
9(1)39
 
- system,
1(1)59,
1(4)325,
1(4)331,
2(1)9,
2(1)49,
2(1)77,
2(3)317,
3(1)75,
3(2)173,
4(2)171,
5(1)25,
5(1)51,
5(3)339,
6(2)223,
6(3)327,
7(1)117,
7(2)169,
7(3)287,
8(2)135,
8(2)239,
8(3)293,
8(3)379,
9(2)207,
9(2)329,
9(2)363,
9(2)377