SORTING JORDAN SEQUENCES IN LINEAR TIME USING LEVEL-LINKED SEARCH-TREES

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] BAYER R., 1972, ACTA INFORM, V1, P173, DOI [DOI 10.1007/BF00288683, 10.1007/BF00288683]

[3] TESTING FOR CONSECUTIVE ONES PROPERTY, INTERVAL GRAPHS, AND GRAPH PLANARITY USING PQ-TREE ALGORITHMS [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (03) : 335 - 379

[4] DESIGN AND ANALYSIS OF A DATA STRUCTURE FOR REPRESENTING SORTED LISTS [J]. SIAM JOURNAL ON COMPUTING, 1980, 9 (03) : 594 - 614

[5] de Fraysseix H., 1982, ANN DISCRETE MATH, V13, P75

[6] EDELSBRUNNER E, 1983, B EUROPEAN ASS THEOR, V21, P195

[7] Fredman M. L., 1976, Theoretical Computer Science, V1, P355, DOI 10.1016/0304-3975(76)90078-5

[8] HOFFMANN K, 1984, B EUROPEAN ASS THEOR, V22, P120

[9] EFFICIENT PLANARITY TESTING [J]. JOURNAL OF THE ACM, 1974, 21 (04) : 549 - 568

[10] HOPCROFT JE, 1972, INFORMATION PROCESSI, V1, P85

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] BAYER R., 1972, ACTA INFORM, V1, P173, DOI [DOI 10.1007/BF00288683, 10.1007/BF00288683]

[3] TESTING FOR CONSECUTIVE ONES PROPERTY, INTERVAL GRAPHS, AND GRAPH PLANARITY USING PQ-TREE ALGORITHMS [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (03) : 335 - 379

[4] DESIGN AND ANALYSIS OF A DATA STRUCTURE FOR REPRESENTING SORTED LISTS [J]. SIAM JOURNAL ON COMPUTING, 1980, 9 (03) : 594 - 614

[5] de Fraysseix H., 1982, ANN DISCRETE MATH, V13, P75

[6] EDELSBRUNNER E, 1983, B EUROPEAN ASS THEOR, V21, P195

[7] Fredman M. L., 1976, Theoretical Computer Science, V1, P355, DOI 10.1016/0304-3975(76)90078-5

[8] HOFFMANN K, 1984, B EUROPEAN ASS THEOR, V22, P120

[9] EFFICIENT PLANARITY TESTING [J]. JOURNAL OF THE ACM, 1974, 21 (04) : 549 - 568

[10] HOPCROFT JE, 1972, INFORMATION PROCESSI, V1, P85