Entry Simon:1988:IAT from tcs1985.bib
Last update: Thu Sep 27 02:46:57 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Simon:1988:IAT,
author = "Klaus Simon",
title = "An improved algorithm for transitive closure on
acyclic digraphs",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "325--346",
month = jun,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ des Saarlandes",
affiliationaddress = "Saarbruecken, West Ger",
classification = "723; 921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Angewandte Math. und Inf., Univ. des Saarlandes,
Saarbrucken, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Acyclic Digraphs; acyclic digraphs; algorithm;
Algorithms; Chain Decomposition; chain decomposition;
Computer Programming; directed graphs; Mathematical
Techniques--Graph Theory; Topological Sorting;
Transitive Closure; transitive closure; transitive
reduction; Worst Case Space; Worst Case Time;
worst-case runtime",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
Related entries
- acyclic,
35(2)165,
37(1)77,
47(2)205,
60(1)1,
61(2)175,
62(1)67,
62(1)221
- B0250,
36(2)319,
38(1)123,
38(2)249,
38(2)293,
38(2)343,
40(2)329,
41(2)141,
41(2)185,
41(2)325,
43(1)99,
45(3)261,
48(1)95,
53(2)201,
53(2)281,
54(2)181,
54(2)215,
54(2)237,
54(2)341,
55(1)87,
56(2)223,
56(2)233,
57(1)153,
58(1)103,
58(1)209,
61(2)175,
61(2)307,
61(2)317,
64(1)25,
64(1)67,
64(1)97,
64(1)119,
65(2)149,
65(2)153,
68(1)89
- case,
52(3)307,
53(2)243,
62(3)251,
63(3)239,
64(1)119,
67(1)87,
68(1)57
- case, worst-,
56(2)211,
62(3)251,
66(1)105
- chain,
35(1)71,
36(2)173,
43(2)277,
49(2)267,
68(3)239
- closure,
35(2)313,
36(2)291,
39(2)281,
40(2)163,
40(2)257,
43(2)251,
43(2)315,
46(2)141,
46(2)159,
47(2)159,
47(3)315,
48(2)145,
48(2)229,
49(1)1,
51(1)53,
51(3)281,
52(3)251,
52(3)281,
57(2)225,
61(2)199,
61(2)283,
63(1)43
- decomposition,
39(2)107,
40(2)245,
43(1)11,
46(1)47,
47(1)1,
47(3)277,
48(1)1,
58(1)175,
61(1)17,
66(1)1
- digraph,
48(2)273,
61(2)175
- directed,
39(2)155,
40(2)149,
41(2)141,
41(2)185,
43(1)99,
44(3)275,
44(3)307,
45(3)261,
47(2)205,
47(3)315,
48(2)273,
52(1)37,
52(1)155,
55(1)87,
56(2)223,
60(1)1,
61(2)175,
61(2)307,
63(2)223,
64(2)191
- Graph, Techniques-,
58(0)3,
58(1)201,
58(1)263,
61(2)121,
61(2)175,
63(2)223,
63(3)253,
63(3)295,
64(1)83,
64(1)125,
64(2)159,
67(1)5
- improved,
36(2)231
- mathematical,
36(2)145,
45(1)1,
57(0)3,
57(1)131,
57(1)147,
57(1)153,
58(0)3,
58(1)17,
58(1)103,
58(1)143,
58(1)183,
58(1)201,
58(1)209,
58(1)263,
58(1)361,
58(1)379,
59(3)277,
59(3)297,
60(1)1,
60(3)297,
61(2)121,
61(2)175,
61(2)225,
61(2)289,
61(2)299,
61(2)307,
62(1)221,
62(3)235,
62(3)251,
63(1)43,
63(1)63,
63(2)223,
63(3)239,
63(3)253,
63(3)275,
63(3)295,
64(1)1,
64(1)15,
64(1)83,
64(1)107,
64(1)125,
64(2)135,
64(2)159,
65(0)123,
65(2)123,
65(2)131,
65(2)143,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)221,
65(2)243,
65(2)249,
65(2)265,
66(0)117,
66(2)137,
66(2)157,
66(2)181,
66(2)205,
67(1)5,
67(1)37,
67(1)55,
67(1)111,
67(1)115
- reduction,
35(1)109,
37(2)123,
39(2)207,
41(1)81,
41(1)113,
41(2)289,
45(1)1,
47(3)263,
51(1)215,
53(1)125,
53(2)201,
54(1)65,
54(2)249,
55(1)47,
56(1)17,
58(1)175,
65(3)271,
68(3)267,
68(3)319
- runtime,
41(2)125
- sorting,
37(2)183,
38(1)83,
43(2)345,
46(2)261,
49(2)171,
52(3)193,
54(2)315,
66(0)117,
66(2)137,
67(1)115
- space,
39(2)267,
41(2)141,
41(2)331,
43(1)59,
47(1)39,
48(1)9,
48(2)145,
48(2)273,
49(2)217,
51(1)221,
52(3)251,
52(3)269,
57(2)327,
58(1)175,
59(3)259,
62(3)251,
64(1)83,
68(1)57,
68(3)253,
69(1)1
- Techniques--Graph,
58(0)3,
58(1)201,
58(1)263,
61(2)121,
61(2)175,
63(2)223,
63(3)253,
63(3)295,
64(1)83,
64(1)125,
64(2)159,
67(1)5
- time,
35(2)215,
36(2)203,
36(2)265,
37(1)1,
37(2)123,
38(2)157,
38(2)249,
38(2)269,
38(2)323,
40(1)31,
40(1)57,
40(1)67,
40(2)175,
40(2)195,
41(1)81,
41(2)141,
43(2)337,
46(2)219,
46(2)261,
47(1)39,
47(1)85,
47(3)315,
47(3)329,
48(1)9,
48(1)35,
48(2)273,
49(1)81,
50(2)183,
51(1)177,
51(1)221,
51(1)239,
52(3)177,
52(3)269,
53(2)201,
54(1)53,
54(1)65,
54(1)129,
54(2)181,
54(2)199,
54(2)249,
54(2)315,
56(1)3,
56(2)211,
57(2)317,
57(2)327,
58(1)57,
58(1)69,
58(1)155,
58(1)175,
58(1)249,
59(1)115,
60(3)255,
60(3)341,
61(2)175,
62(1)105,
63(1)43,
63(3)295,
68(1)57,
68(3)319,
69(2)117
- topological,
37(2)183,
38(1)17,
38(1)35,
43(1)31,
43(1)59,
44(1)107,
52(1)165,
58(1)209,
64(2)191,
66(1)1,
67(1)121
- transitive,
40(2)257,
44(1)17,
44(1)107,
46(2)159,
47(3)315,
59(3)287,
65(2)265,
67(1)65
- worst,
62(3)251,
64(1)119,
68(1)57
- worst-case,
56(2)211,
62(3)251,
66(1)105,
68(1)57