Lundgren, J. Richard; Maybee, John S.; McMorris, F. R. Two-graph inversion of competition graphs and bound graphs. (English) Zbl 0669.05042 Combinatorics, graph theory, and computing, Proc. 19th Southeast. Conf., Boca Raton/Fla. 1988, Congr. Numerantium 67, 136-144 (1988). MSC: 05C35 05C20 PDFBibTeX XML
Tsotskolauri, N. I. On a search algorithm for effective paths in an oriented acyclic graph. (Russian. English summary) Zbl 0665.05020 Soobshch. Akad. Nauk Gruz. SSR 132, No. 3, 497-500 (1988). MSC: 05C20 68R10 PDFBibTeX XMLCite \textit{N. I. Tsotskolauri}, Soobshch. Akad. Nauk Gruz. SSR 132, No. 3, 497--500 (1988; Zbl 0665.05020)
Ahmad, S. Hasanuddin Simple enumeration of minimal cutsets of acyclic directed graph. (English) Zbl 0664.90030 IEEE Trans. Reliab. 37, No. 5, 484-487 (1988). MSC: 90B10 90C35 68R10 90B25 PDFBibTeX XMLCite \textit{S. H. Ahmad}, IEEE Trans. Reliab. 37, No. 5, 484--487 (1988; Zbl 0664.90030) Full Text: DOI
Italiano, Guiseppe F. Finding paths and deleting edges in directed acyclic graphs. (English) Zbl 0663.68052 Inf. Process. Lett. 28, No. 1, 5-11 (1988). Reviewer: M.Zimand MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{G. F. Italiano}, Inf. Process. Lett. 28, No. 1, 5--11 (1988; Zbl 0663.68052) Full Text: DOI
Stachowiak, Grzegorz The number of linear extensions of bipartite graphs. (English) Zbl 0663.06001 Order 5, No. 3, 257-259 (1988). Reviewer: B.Zelinka MSC: 06A06 05C20 06A05 PDFBibTeX XMLCite \textit{G. Stachowiak}, Order 5, No. 3, 257--259 (1988; Zbl 0663.06001) Full Text: DOI
Banerjee, Jay; Kim, Won; Kim, Sung-jo; Garza, Jorge F. Clustering a DAG for CAD databases. (English) Zbl 0662.68118 IEEE Trans. Softw. Eng. 14, No. 11, 1684-1699 (1988). MSC: 68P20 68U99 68R10 68P10 68P05 PDFBibTeX XMLCite \textit{J. Banerjee} et al., IEEE Trans. Softw. Eng. 14, No. 11, 1684--1699 (1988; Zbl 0662.68118) Full Text: DOI
Cantone, Domenico; Ghelfo, Susanna; Omodeo, Eugenio The automation of syllogistic. I: Syllogistic normal forms. (English) Zbl 0658.03010 J. Symb. Comput. 6, No. 1, 83-98 (1988). Reviewer: L.State MSC: 03B35 03B30 PDFBibTeX XMLCite \textit{D. Cantone} et al., J. Symb. Comput. 6, No. 1, 83--98 (1988; Zbl 0658.03010) Full Text: DOI
Bossut, Francis; Dauchet, Max; Warin, Bruno Automata and rational expressions on planar graphs. (English) Zbl 0656.68079 Mathematical foundations of computer science, Proc. 13th Symp., Carlsbad/Czech. 1988, Lect. Notes Comput. Sci. 324, 190-200 (1988). Reviewer: G.Slutzki MSC: 68Q45 68R10 PDFBibTeX XML
Simon, Klaus An improved algorithm for transitive closure on acyclic digraphs. (English) Zbl 0656.68047 Theor. Comput. Sci. 58, No. 1-3, 325-346 (1988). Reviewer: M.Křivánek MSC: 68Q25 05C20 68R10 PDFBibTeX XMLCite \textit{K. Simon}, Theor. Comput. Sci. 58, No. 1--3, 325--346 (1988; Zbl 0656.68047) Full Text: DOI
Simon, Hans-Ulrich A continuous bound on the performance of critical-path schedules. (English) Zbl 0656.68038 J. Inf. Process. Cybern. 24, No. 4-5, 171-187 (1988). MSC: 68M20 05C20 68N99 68R10 PDFBibTeX XMLCite \textit{H.-U. Simon}, J. Inf. Process. Cybern. 24, No. 4--5, 171--187 (1988; Zbl 0656.68038)
Escudero, L. F. An inexact algorithm for the sequential ordering problem. (English) Zbl 0653.90036 Eur. J. Oper. Res. 37, No. 2, 236-249 (1988). MSC: 90B35 90C27 65K05 90C35 PDFBibTeX XMLCite \textit{L. F. Escudero}, Eur. J. Oper. Res. 37, No. 2, 236--249 (1988; Zbl 0653.90036) Full Text: DOI
Dwork, Cynthia; Kanellakis, Paris C.; Stockmeyer, Larry Parallel algorithms for term matching. (English) Zbl 0651.68110 SIAM J. Comput. 17, No. 4, 711-731 (1988). MSC: 68T15 68R10 68Q25 PDFBibTeX XMLCite \textit{C. Dwork} et al., SIAM J. Comput. 17, No. 4, 711--731 (1988; Zbl 0651.68110) Full Text: DOI
Gabow, Harold N. Scheduling UET systems on two uniform processors and length two pipelines. (English) Zbl 0651.68039 SIAM J. Comput. 17, No. 4, 810-829 (1988). MSC: 68M20 90B35 68N99 68R10 PDFBibTeX XMLCite \textit{H. N. Gabow}, SIAM J. Comput. 17, No. 4, 810--829 (1988; Zbl 0651.68039) Full Text: DOI
Miyano, Satoru \(\Delta^ p_ 2\)-complete lexicographically first maximal subgraph problems. (English) Zbl 0649.68072 Mathematical foundations of computer science, Proc. 13th Symp., Carlsbad/Czech. 1988, Lect. Notes Comput. Sci. 324, 454-462 (1988). MSC: 68R10 68Q25 PDFBibTeX XML
Belik, Ferenc A distributed deadlock avoidance technique. (English) Zbl 0648.68037 Distributed algorithms, Proc. 2nd Int. Workshop, Amsterdam/Neth. 1987, Lect. Notes Comput.Sci. 312, 144-154 (1988). MSC: 68N25 68R10 PDFBibTeX XML
Chaudhuri, Pranay Fast parallel graph searching with applications. (English) Zbl 0645.68071 BIT 28, No. 1, 2-18 (1988). MSC: 68P10 68Q25 68R10 68N25 PDFBibTeX XMLCite \textit{P. Chaudhuri}, BIT 28, No. 1, 2--18 (1988; Zbl 0645.68071) Full Text: DOI
Dolev, Danny; Gil, Joseph Parallel computation of edit distance. (English) Zbl 0645.68066 Parallel processing and applications, Proc. Int. Conf., L’Aquila/Italy 1987, 265-275 (1988). MSC: 68P10 68Q25 68T20 68R10 PDFBibTeX XML
Tzeng, Chun-Hung A theory of heuristic information in game-tree search. (English) Zbl 0658.90101 Symbolic Computation. Artificial Intelligence. Berlin etc.: Springer- Verlag. x, 107 p. DM 62.00 (1988). Reviewer: S.J.Turnball MSC: 91A05 90B40 68T99 62C20 PDFBibTeX XMLCite \textit{C.-H. Tzeng}, A theory of heuristic information in game-tree search. Berlin etc.: Springer-Verlag (1988; Zbl 0658.90101)
Saltz, Joel Methods for automated problem mapping. (English) Zbl 0736.65017 Numerical algorithms for modern parallel computer architectures, Proc. Workshop IMA Progr., Minneapolis/MN (USA) 1986-87, IMA Vol. Math. Appl. 13, 173-195 (1988). Reviewer: T.C.Mohan (Madras) MSC: 65F05 65F50 65Y10 65Y05 65Y20 05C50 68R10 PDFBibTeX XMLCite \textit{J. Saltz}, in: Numerical algorithms for modern parallel computer architectures, Proc. Workshop IMA Progr., Minneapolis/MN (USA) 1986-87, IMA Vol. Math. Appl. 13, . 173--195 (1988; Zbl 0736.65017)
Chaudhuri, Pranay Fast parallel algorithms for a class of graph problems. (English) Zbl 0654.68080 J. Comb. Inf. Syst. Sci. 12, No. 1-2, 51-65 (1987). MSC: 68R10 05-04 68P10 68Q25 PDFBibTeX XMLCite \textit{P. Chaudhuri}, J. Comb. Inf. Syst. Sci. 12, No. 1--2, 51--65 (1987; Zbl 0654.68080)
Pitt, Leonard A note on extending Knuth’s tree estimator to directed acyclic graphs. (English) Zbl 0653.68059 Inf. Process. Lett. 24, 203-206 (1987). MSC: 68P10 68R10 68T20 68P05 PDFBibTeX XMLCite \textit{L. Pitt}, Inf. Process. Lett. 24, 203--206 (1987; Zbl 0653.68059) Full Text: DOI
Papadimitriou, Christos H.; Ullman, Jeffrey D. A communication-time tradeoff. (English) Zbl 0649.68048 SIAM J. Comput. 16, 639-646 (1987). MSC: 68Q25 68R10 68N25 PDFBibTeX XMLCite \textit{C. H. Papadimitriou} and \textit{J. D. Ullman}, SIAM J. Comput. 16, 639--646 (1987; Zbl 0649.68048) Full Text: DOI
Miller, D. M. Graph algorithms for the manipulation of Boolean functions and their spectra. (English) Zbl 0642.94051 Numerical mathematics and computing, Proc. 16th Conf., Winnipeg/Manit. 1986, Congr. Numerantium 57, 177-199 (1987). MSC: 94C10 94C15 68R10 PDFBibTeX XML
Blumer, Janet A. How much is that DAWG in the window ? A moving window algorithm for the directed acyclic word graph. (English) Zbl 0636.68109 J. Algorithms 8, 451-469 (1987). MSC: 68Q45 68Q25 68P05 PDFBibTeX XMLCite \textit{J. A. Blumer}, J. Algorithms 8, 451--469 (1987; Zbl 0636.68109) Full Text: DOI
Bordat, J. P. Complexité de problèmes liés aux graphes sans circuit. (Complexity of problems connected with acyclic graphs). (French) Zbl 0634.68031 RAIRO, Inf. Théor. Appl. 21, 181-197 (1987). MSC: 68Q25 68R10 05C20 PDFBibTeX XMLCite \textit{J. P. Bordat}, RAIRO, Inform. Théor. Appl. 21, 181--197 (1987; Zbl 0634.68031) Full Text: DOI EuDML
Kirousis, Lefteris M.; Papadimitriou, Christos H. Searching and pebbling. (English) Zbl 0616.68064 Theor. Comput. Sci. 47, 205-218 (1986). Reviewer: J.Ebert MSC: 68R10 68Q25 68P10 05C20 PDFBibTeX XMLCite \textit{L. M. Kirousis} and \textit{C. H. Papadimitriou}, Theor. Comput. Sci. 47, 205--218 (1986; Zbl 0616.68064) Full Text: DOI
Neumann-Lara, V.; Santoro, N.; Urrutia, J. Uniquely colourable m-dichromatic oriented graphs. (English) Zbl 0613.05023 Discrete Math. 62, 65-70 (1986). Reviewer: M.Koman MSC: 05C15 05C20 PDFBibTeX XMLCite \textit{V. Neumann-Lara} et al., Discrete Math. 62, 65--70 (1986; Zbl 0613.05023) Full Text: DOI
Provan, J. Scott The complexity of reliability computations in planar and acyclic graphs. (English) Zbl 0606.68066 SIAM J. Comput. 15, 694-702 (1986). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{J. S. Provan}, SIAM J. Comput. 15, 694--702 (1986; Zbl 0606.68066) Full Text: DOI DOI
Bertossi, Alan A. Total domination in interval graphs. (English) Zbl 0604.05032 Inf. Process. Lett. 23, 131-134 (1986). MSC: 05C99 PDFBibTeX XMLCite \textit{A. A. Bertossi}, Inf. Process. Lett. 23, 131--134 (1986; Zbl 0604.05032) Full Text: DOI
Bryant, Randal E. Graph-based algorithms for Boolean function manipulation. (English) Zbl 0593.94022 IEEE Trans. Comput. 35, 677-691 (1986). MSC: 94C10 94C15 68W30 68Q25 PDFBibTeX XMLCite \textit{R. E. Bryant}, IEEE Trans. Comput. 35, 677--691 (1986; Zbl 0593.94022) Full Text: DOI
Zhang, Y. A note on parallel depth first search. (English) Zbl 0591.68072 BIT 26, 195-198 (1986). MSC: 68R10 PDFBibTeX XMLCite \textit{Y. Zhang}, BIT 26, 195--198 (1986; Zbl 0591.68072) Full Text: DOI
Klawe, Maria M. A tight bound for black and white pebbles on the pyramid. (English) Zbl 0632.68042 J. Assoc. Comput. Mach. 32, 218-228 (1985). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{M. M. Klawe}, J. Assoc. Comput. Mach. 32, 218--228 (1985; Zbl 0632.68042) Full Text: DOI
Brudaru, O. A parallel algorithm for a variant of the acyclic partition problem. (English) Zbl 0615.68046 Graphen und Netzwerke - Theorie und Anwendungen, 30. int. wiss. Kolloq., Ilmenau 1985, Heft 5, 29-32 (1985). MSC: 68R10 05C70 05C20 PDFBibTeX XML
Klawe, Maria M. The complexity of pebbling for two classes of graphs. (English) Zbl 0593.05057 Graph theory with applications to algorithms and computer science, Proc. 5th Int. Conf., Kalamazoo/Mich. 1984, 475-487 (1985). MSC: 05C99 05C20 68Q25 PDFBibTeX XML
Richter, Knut Complexity of the robot sequencing problem. (English) Zbl 0587.90053 Seminarber., Humboldt-Univ. Berlin, Sekt. Math. 71, 94-99 (1985). MSC: 90B35 90C10 68R10 05C35 68Q25 PDFBibTeX XMLCite \textit{K. Richter}, Seminarber., Humboldt-Univ. Berlin, Sekt. Math. 71, 94--99 (1985; Zbl 0587.90053)
Savage, John E.; Vitter, Jeffrey Scott Parallelism in space-time tradeoffs. (English) Zbl 0586.68057 VLSI: Algorithms and architectures, Proc. Int. Workshop Parallel Comput. VLSI, Amalfi/Italy 1984, 49-58 (1985). MSC: 68R10 68Q25 68N25 PDFBibTeX XML
Green, Christopher D.; Suraweera, Francis A path entropy function for rooted acyclic digraphs. (English) Zbl 0585.05010 J. Univ. Kuwait, Sci. 12, 15-21 (1985). Reviewer: P.Avery MSC: 05C20 05C38 05C05 68R10 PDFBibTeX XMLCite \textit{C. D. Green} and \textit{F. Suraweera}, J. Univ. Kuwait, Sci. 12, 15--21 (1985; Zbl 0585.05010)
Dunne, Paul E. Lower bounds on the complexity of 1-time only branching programs. (English) Zbl 0575.68064 Fundamentals of computation theory, Proc. 5th Int. Conf., Cottbus/Ger. 1985, Lect. Notes Comput. Sci. 199, 90-99 (1985). MSC: 68Q25 68R10 94C10 05C45 05C70 PDFBibTeX XML
Asano, Tetsuo; Sato, Shinichi Long path enumeration algorithms for timing verification on large digital systems. (English) Zbl 0572.05034 Graph theory with applications to algorithms and computer science, Proc. 5th Int. Conf., Kalamazoo/Mich. 1984, 25-35 (1985). Reviewer: E.M.Palmer MSC: 05C30 05C38 68R10 PDFBibTeX XML
Hanlon, P. The chromatic polynomial of an unlabeled graph. (English) Zbl 0567.05025 J. Comb. Theory, Ser. B 38, 226-239 (1985). Reviewer: E.M.Palmer MSC: 05C15 05C20 05C30 PDFBibTeX XMLCite \textit{P. Hanlon}, J. Comb. Theory, Ser. B 38, 226--239 (1985; Zbl 0567.05025) Full Text: DOI
Reinelt, G. The linear ordering problem: algorithms and applications. (English) Zbl 0565.68058 Research and Exposition in Mathematics, 8. Berlin: Heldermann Verlag. XI, 158 p. (1985). Reviewer: J.K.Lenstra MSC: 68Rxx 90C05 90-04 68-02 90-02 PDFBibTeX XML
Thomassen, Carsten The 2-linkage problem for acyclic digraphs. (English) Zbl 0563.05027 Discrete Math. 55, 73-87 (1985). Reviewer: W.-K.Chen MSC: 05C20 05C38 05C10 PDFBibTeX XMLCite \textit{C. Thomassen}, Discrete Math. 55, 73--87 (1985; Zbl 0563.05027) Full Text: DOI
Jünger, M. Polyhedral combinatorics and the acyclic subdigraph problem. (English) Zbl 0557.68045 Research and Exposition in Mathematics, 7. Berlin: Heldermann Verlag. x, 128 p. DM 36.00 (1985). Reviewer: Jan Karel Lenstra (Amsterdam) MSC: 90C57 90-02 05-02 68-02 05C20 51M20 68R10 PDFBibTeX XML
Mohan, C.; Fussell, D.; Silberschatz, A. Compatibility and commutativity of lock modes. (English) Zbl 0591.68028 Inf. Control 61, 38-64 (1984). MSC: 68N25 PDFBibTeX XMLCite \textit{C. Mohan} et al., Inf. Control 61, 38--64 (1984; Zbl 0591.68028) Full Text: DOI
Dwork, Cynthia; Kanellakis, Paris C.; Mitchell, John C. On the sequential nature of unification. (English) Zbl 0588.68045 J. Logic Program. 1, 35-50 (1984). MSC: 68T15 68Q25 68R10 PDFBibTeX XMLCite \textit{C. Dwork} et al., J. Log. Program. 1, 35--50 (1984; Zbl 0588.68045) Full Text: DOI
Tarjan, Robert E. Input-output decomposition of dynamic systems is NP-complete. (English) Zbl 0563.93010 IEEE Trans. Autom. Control 29, 863-864 (1984). MSC: 93A15 05C20 94C15 PDFBibTeX XMLCite \textit{R. E. Tarjan}, IEEE Trans. Autom. Control 29, 863--864 (1984; Zbl 0563.93010) Full Text: DOI
Berge, C. A property of k-optimal path-partitions. (English) Zbl 0558.05025 Progress in graph theory, Proc. Conf., Combinatorics, Waterloo/Ont. 1982, 105-108 (1984). Reviewer: D.J.Kleitman MSC: 05C20 05C70 05C38 05C15 PDFBibTeX XML
Ntafos, Simeon; Gonzalez, Teofilo On the computational complexity of path cover problems. (English) Zbl 0547.68044 J. Comput. Syst. Sci. 29, 225-242 (1984). MSC: 68Q25 68R10 05C38 05C20 PDFBibTeX XMLCite \textit{S. Ntafos} and \textit{T. Gonzalez}, J. Comput. Syst. Sci. 29, 225--242 (1984; Zbl 0547.68044) Full Text: DOI
Kulkarni, Vidyadhar G. A compact hash function for paths in PERT networks. (English) Zbl 0544.90096 Oper. Res. Lett. 3, 137-140 (1984). MSC: 90C35 05C38 68R10 90B35 PDFBibTeX XMLCite \textit{V. G. Kulkarni}, Oper. Res. Lett. 3, 137--140 (1984; Zbl 0544.90096) Full Text: DOI
Chebotar’, K. S. On an optimization problem on a set of permutations. (Russian) Zbl 0544.05002 Izv. Akad. Nauk Mold. SSR, Ser. Fiz.-Tekh. Mat. Nauk 1984, No. 1, 51-53 (1984). Reviewer: E.Fuchs MSC: 05A05 05C20 PDFBibTeX XMLCite \textit{K. S. Chebotar'}, Izv. Akad. Nauk Mold. SSR, Ser. Fiz.-Tekh. Mat. Nauk 1984, No. 1, 51--53 (1984; Zbl 0544.05002)
Fiat, Amos; Shamir, Adi Generalized ”write-once” memories. (English) Zbl 0543.68054 IEEE Trans. Inf. Theory 30, 470-480 (1984). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{A. Fiat} and \textit{A. Shamir}, IEEE Trans. Inf. Theory 30, 470--480 (1984; Zbl 0543.68054) Full Text: DOI
Ghosh, Ratan K.; Bhattacharjee, G. P. A parallel search algorithm for directed acyclic graphs. (English) Zbl 0542.68049 BIT 24, 134-150 (1984). MSC: 68R10 68Q25 68P10 PDFBibTeX XMLCite \textit{R. K. Ghosh} and \textit{G. P. Bhattacharjee}, BIT 24, 134--150 (1984; Zbl 0542.68049) Full Text: DOI
Steiner, George Single machine scheduling with precedence constraints of dimension 2. (English) Zbl 0541.90054 Math. Oper. Res. 9, 248-259 (1984). Reviewer: Y.M.Shafranskij MSC: 90B35 68Q25 90C39 PDFBibTeX XMLCite \textit{G. Steiner}, Math. Oper. Res. 9, 248--259 (1984; Zbl 0541.90054) Full Text: DOI Link
Procesi Ciampi, R. A criterion for acyclic orientations. (English) Zbl 0569.05048 Boll. Unione Mat. Ital., VI. Ser., D, Algebra Geom. 2, No. 1, 1-7 (1983). Reviewer: G.Chaty MSC: 05C99 05C20 05C30 PDFBibTeX XMLCite \textit{R. Procesi Ciampi}, Boll. Unione Mat. Ital., VI. Ser., D, Algebra Geom. 2, No. 1, 1--7 (1983; Zbl 0569.05048)
Franke, Hans-Gerhard Analyse der mittleren Rechenzeit für den transitiven Abschluß azyklischer Graphen. (German) Zbl 0544.68048 Fachbereich Mathematik der Johann Wolfgang Goethe-Universität zu Frankfurt am Main. 125 S. (1983). MSC: 68R10 68Q25 05C20 PDFBibTeX XML
Ciampi Procesi, Rita A minimality property for acyclic orientations. (English) Zbl 0544.05032 Rend. Mat. Appl., VII. Ser. 3, 681-685 (1983). Reviewer: W.Li MSC: 05C20 05C35 PDFBibTeX XMLCite \textit{R. Ciampi Procesi}, Rend. Mat. Appl., VII. Ser. 3, 681--685 (1983; Zbl 0544.05032)
Kantsedal, S. A. A decomposition approach to the solution of large-scale scheduling problems. (English. Russian original) Zbl 0543.90063 Autom. Remote Control 44, 1360-1366 (1983); translation from Avtom. Telemekh. 1983, No. 10, 144-151 (1983). MSC: 90B35 65K05 PDFBibTeX XMLCite \textit{S. A. Kantsedal}, Autom. Remote Control 44, 1360--1366 (1983; Zbl 0543.90063); translation from Avtom. Telemekh. 1983, No. 10, 144--151 (1983)
Greene, Curtis; Zaslavsky, Thomas On the interpretation of Whitney numbers through arrangements of hyperplanes, zonotopes, non-Radon partitions, and orientations of graphs. (English) Zbl 0539.05024 Trans. Am. Math. Soc. 280, 97-126 (1983). Reviewer: J.G.Oxley MSC: 05B35 05C20 05C99 PDFBibTeX XMLCite \textit{C. Greene} and \textit{T. Zaslavsky}, Trans. Am. Math. Soc. 280, 97--126 (1983; Zbl 0539.05024) Full Text: DOI
Schweickert, Richard Synthesizing partial orders given comparability information: Partitive sets and slack in critical path networks. (English) Zbl 0538.92025 J. Math. Psychol. 27, 261-276 (1983). Reviewer: L.Olaru MSC: 91E99 05C20 06A06 05C38 PDFBibTeX XMLCite \textit{R. Schweickert}, J. Math. Psychol. 27, 261--276 (1983; Zbl 0538.92025) Full Text: DOI
Fernandez de la Vega, W. On the maximum cardinality of a consistent set of arcs in a random tournament. (English) Zbl 0531.05036 J. Comb. Theory, Ser. B 35, 328-332 (1983). Reviewer: J.W.Moon MSC: 05C20 05C80 60C05 PDFBibTeX XMLCite \textit{W. Fernandez de la Vega}, J. Comb. Theory, Ser. B 35, 328--332 (1983; Zbl 0531.05036) Full Text: DOI
Taraszow, Oleg G. Enumeration of acyclic supertournaments of a finite, labeled, acyclic digraph. (English) Zbl 0528.05035 Graphs and other combinatorial topics. Proc. 3rd Czech. Symp., Prague 1982, Teubner-Texte Math. 59, 320-324 (1983). MSC: 05C20 05C30 PDFBibTeX XML
Spinrad, Jeremy; Valdes, Jacobo Recognition and isomorphism of two dimensional partial orders. (English) Zbl 0521.68081 Automata, languages and programming, 10th Colloq., Barcelona/Spain 1983, Lect. Notes Comput. Sci. 154, 676-686 (1983). MSC: 68R99 06A06 68R10 05C20 PDFBibTeX XML
Shmueli, Oded Dynamic cycle detection. (English) Zbl 0521.68071 Inf. Process. Lett. 17, 185-188 (1983). MSC: 68R10 68N25 PDFBibTeX XMLCite \textit{O. Shmueli}, Inf. Process. Lett. 17, 185--188 (1983; Zbl 0521.68071) Full Text: DOI
Descles, J. P. Graphes sans circuit et bilinearite. (French) Zbl 0519.18002 Math. Sci. Hum. 81, 5-45 (1983). MSC: 18A10 18E05 05C38 05C50 68R10 18A30 PDFBibTeX XMLCite \textit{J. P. Descles}, Math. Sci. Hum. 81, 5--45 (1983; Zbl 0519.18002) Full Text: Numdam EuDML
Grundspenkis, Janis Automatized synthesis and analysis of the structure of complex systems. (English) Zbl 0517.93027 Mathematical methods for the analysis of large-scale systems, Proc. 4th Formator Symp., Liblice/Czech. 1982, 241-255 (1983). MSC: 93B50 05C20 68R10 68Q25 68U20 93A15 93B40 94C15 PDFBibTeX XML
Morlock, Martin Projektkostenminimierung in Abhängigkeit von der Projektdauer. (German) Zbl 0514.90046 Methods Oper. Res. 45, 293-302 (1983). MSC: 90B35 90B10 PDFBibTeX XMLCite \textit{M. Morlock}, Methods Oper. Res. 45, 293--302 (1983; Zbl 0514.90046)
Rosenberg, A. L.; Sudborough, I. H. Bandwidth and pebbling. (English) Zbl 0509.90100 Computing 31, 115-139 (1983). MSC: 91A24 68Q25 PDFBibTeX XMLCite \textit{A. L. Rosenberg} and \textit{I. H. Sudborough}, Computing 31, 115--139 (1983; Zbl 0509.90100) Full Text: DOI
Johnson, D. S.; Niemi, K. A. On knapsacks, partitions, and a new dynamic programming technique for trees. (English) Zbl 0506.90035 Math. Oper. Res. 8, 1-14 (1983). MSC: 90B35 90C39 90C10 68Q25 PDFBibTeX XMLCite \textit{D. S. Johnson} and \textit{K. A. Niemi}, Math. Oper. Res. 8, 1--14 (1983; Zbl 0506.90035) Full Text: DOI Link
Lev, G.; Valiant, L. G. Size bounds for superconcentrators. (English) Zbl 0497.68022 Theor. Comput. Sci. 22, 233-251 (1983). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{G. Lev} and \textit{L. G. Valiant}, Theor. Comput. Sci. 22, 233--251 (1983; Zbl 0497.68022) Full Text: DOI
Price, Camille C.; Pooch, Udo W. Search techniques for a nonlinear multiprocessor scheduling problem. (English) Zbl 0535.68016 Nav. Res. Logist. Q. 29, 213-233 (1982). MSC: 68M20 90C20 90B40 90B35 PDFBibTeX XMLCite \textit{C. C. Price} and \textit{U. W. Pooch}, Nav. Res. Logist. Q. 29, 213--233 (1982; Zbl 0535.68016) Full Text: DOI
Serik, A. E. Using precedence intervals to solve constrained precedence problems. (English. Russian original) Zbl 0513.90040 Cybernetics 18, 471-477 (1983); translation from Kibernetika 1982, No. 4, 61-65 (1982). MSC: 90B35 PDFBibTeX XMLCite \textit{A. E. Serik}, Cybernetics 18, 471--477 (1982; Zbl 0513.90040); translation from Kibernetika 1982, No. 4, 61--65 (1982) Full Text: DOI
Opsut, Robert J. On the computation of the competition number of a graph. (English) Zbl 0512.05032 SIAM J. Algebraic Discrete Methods 3, 420-428 (1982). MSC: 05C20 05C99 68Q25 PDFBibTeX XMLCite \textit{R. J. Opsut}, SIAM J. Algebraic Discrete Methods 3, 420--428 (1982; Zbl 0512.05032) Full Text: DOI
Blass, Andreas; Harary, Frank Deletion versus alteration in finite structures. (English) Zbl 0506.05038 J. Comb. Inf. Syst. Sci. 7, 139-142 (1982). MSC: 05C35 05C20 05C99 PDFBibTeX XMLCite \textit{A. Blass} and \textit{F. Harary}, J. Comb. Inf. Syst. Sci. 7, 139--142 (1982; Zbl 0506.05038)
Carlson, David A.; Savage, John E. Extreme time-space tradeoffs for graphs with small space requirements. (English) Zbl 0503.68049 Inf. Process. Lett. 14, 223-227 (1982). MSC: 68R10 68Q25 05C20 PDFBibTeX XMLCite \textit{D. A. Carlson} and \textit{J. E. Savage}, Inf. Process. Lett. 14, 223--227 (1982; Zbl 0503.68049) Full Text: DOI
Chakravarty, A. K.; Orlin, J. B.; Rothblum, U. G. A partitioning problem with additive objective with an application to optimal inventory groupings for joint replenishment. (English) Zbl 0491.90034 Oper. Res. 30, 1018-1022 (1982). MSC: 90B05 90C35 05C35 PDFBibTeX XMLCite \textit{A. K. Chakravarty} et al., Oper. Res. 30, 1018--1022 (1982; Zbl 0491.90034) Full Text: DOI
Schnitger, Georg A family of graphs with expensive depth-reduction. (English) Zbl 0485.68054 Theor. Comput. Sci. 18, 89-93 (1982). MSC: 68R10 05C20 PDFBibTeX XMLCite \textit{G. Schnitger}, Theor. Comput. Sci. 18, 89--93 (1982; Zbl 0485.68054) Full Text: DOI
Gabow, Harold N. An almost-linear algorithm for two-processor scheduling. (English) Zbl 0485.68034 J. Assoc. Comput. Mach. 29, 766-780 (1982). MSC: 68M20 68R10 PDFBibTeX XMLCite \textit{H. N. Gabow}, J. Assoc. Comput. Mach. 29, 766--780 (1982; Zbl 0485.68034) Full Text: DOI
Sethi, Ravi Pebble games for studying storage sharing. (English) Zbl 0479.68070 Theor. Comput. Sci. 19, 69-84 (1982). MSC: 68R99 PDFBibTeX XMLCite \textit{R. Sethi}, Theor. Comput. Sci. 19, 69--84 (1982; Zbl 0479.68070) Full Text: DOI
Gabber, Ofer; Galil, Zvi Explicit constructions of linear-sized superconcentrators. (English) Zbl 0487.05045 J. Comput. Syst. Sci. 22, 407-420 (1981). MSC: 05C40 94C15 PDFBibTeX XMLCite \textit{O. Gabber} and \textit{Z. Galil}, J. Comput. Syst. Sci. 22, 407--420 (1981; Zbl 0487.05045) Full Text: DOI
Kamimura, Tsutomu; Slutzki, Giora Parallel and two-way automata on directed ordered acyclic graphs. (English) Zbl 0482.68051 Inf. Control 49, 10-51 (1981). MSC: 68Q45 68R10 PDFBibTeX XMLCite \textit{T. Kamimura} and \textit{G. Slutzki}, Inf. Control 49, 10--51 (1981; Zbl 0482.68051) Full Text: DOI
Chakravarty, A. K. Partitioning acyclic stochastic precedence graph. (English) Zbl 0468.05029 Indian J. Pure Appl. Math. 12, 41-54 (1981). MSC: 05C20 90C39 94C15 PDFBibTeX XMLCite \textit{A. K. Chakravarty}, Indian J. Pure Appl. Math. 12, 41--54 (1981; Zbl 0468.05029)
Kaas, R. A branch and bound algorithm for the acyclic subgraph problem. (English) Zbl 0465.90090 Eur. J. Oper. Res. 8, 355-362 (1981). MSC: 90C35 05C35 05C20 90C10 65K05 PDFBibTeX XMLCite \textit{R. Kaas}, Eur. J. Oper. Res. 8, 355--362 (1981; Zbl 0465.90090) Full Text: DOI
Chakravarty, A. K. Optimal segmentation of graphs with exclusive OR nodes. (English) Zbl 0464.68063 Appl. Math. Modelling 5, 231-236 (1981). MSC: 68R10 68N99 94C10 94C15 PDFBibTeX XMLCite \textit{A. K. Chakravarty}, Appl. Math. Modelling 5, 231--236 (1981; Zbl 0464.68063) Full Text: DOI
Schnitger, Georg A family of graphs with expensive depth-reduction. (English) Zbl 0457.68064 Theoretical computer science, 5th GI-Conf., Karlsruhe 1981, Lect. Notes Comput. Sci. 104, 91-97 (1981). MSC: 68R10 PDFBibTeX XML
Ibaraki, Toshihide; Kameda, Tsunehiko; Toida, Shunichi On minimal test sets for locating single link failures in networks. (English) Zbl 0455.94048 IEEE Trans. Comput. 30, 182-190 (1981). MSC: 94C15 68Q25 PDFBibTeX XMLCite \textit{T. Ibaraki} et al., IEEE Trans. Comput. 30, 182--190 (1981; Zbl 0455.94048) Full Text: DOI
Meyer Auf Der Heide, Friedhelm A comparison of two variations of a pebble game on graphs. (English) Zbl 0454.05031 Theor. Comput. Sci. 13, 315-322 (1981). MSC: 05C20 05C05 90C05 91A24 68Q05 PDFBibTeX XMLCite \textit{F. Meyer Auf Der Heide}, Theor. Comput. Sci. 13, 315--322 (1981; Zbl 0454.05031) Full Text: DOI
Perl, Y.; Zaks, S. Deficient generalized Fibonacci maximum path graphs. (English) Zbl 0451.05028 Discrete Math. 34, 153-164 (1981). MSC: 05C38 05C20 PDFBibTeX XMLCite \textit{Y. Perl} and \textit{S. Zaks}, Discrete Math. 34, 153--164 (1981; Zbl 0451.05028) Full Text: DOI
Reischuk, Rüdiger Improved bounds on the problem of time-space trade-off in the pebble game. (English) Zbl 0468.68068 J. Assoc. Comput. Mach. 27, 839-849 (1980). MSC: 68R10 68Q05 68Q25 PDFBibTeX XMLCite \textit{R. Reischuk}, J. Assoc. Comput. Mach. 27, 839--849 (1980; Zbl 0468.68068) Full Text: DOI
Reischuk, Rüdiger Improved bounds on the problem of time-space trade-off in the pebble game. (English) Zbl 0468.05030 J. Assoc. Comput. Mach. 27, 839-849 (1980). MSC: 05C20 05C35 68R10 PDFBibTeX XMLCite \textit{R. Reischuk}, J. Assoc. Comput. Mach. 27, 839--849 (1980; Zbl 0468.05030) Full Text: DOI
Ntafos, S. C. On the complexity of some minimum path cover problems. (English) Zbl 0453.68031 Combinatorics, graph theory and computing, Proc. 11th southeast. Conf., Boca Raton/Florida 1980, Vol. II, Congr. Numerantium 29, 699 (1980). MSC: 68R10 05C38 05C70 05C20 68Q25 PDFBibTeX XML
Loui, Michael C. A note on the pebble game. (English) Zbl 0448.90098 Inf. Process. Lett. 11, 24-26 (1980). MSC: 91A24 05C20 68Q25 PDFBibTeX XMLCite \textit{M. C. Loui}, Inf. Process. Lett. 11, 24--26 (1980; Zbl 0448.90098) Full Text: DOI
Blum, Manuel; Chandra, Ashok K.; Wegman, Mark N. Equivalence of free Boolean graphs can be decided probabilistically in polynomial time. (English) Zbl 0444.68059 Inf. Process. Lett. 10, 80-82 (1980). MSC: 68R10 68Q25 68Q60 PDFBibTeX XMLCite \textit{M. Blum} et al., Inf. Process. Lett. 10, 80--82 (1980; Zbl 0444.68059) Full Text: DOI
Berztiss, A. T. Depth-first K-trees and critical path analysis. (English) Zbl 0431.68064 Acta Inf. 13, 325-346 (1980). MSC: 68R10 05C20 05C05 90B35 PDFBibTeX XMLCite \textit{A. T. Berztiss}, Acta Inf. 13, 325--346 (1980; Zbl 0431.68064) Full Text: DOI
Kamimura, Tsutomu; Slutzki, Giora Parallel and two-way recognizers of directed acyclic graphs. (English) Zbl 0431.68079 Mathematical fondations of computer science, Proc. 8th Symp., Olomouc/Czech. 1979, Lect. Notes Comput. Sci. 74, 317-325 (1979). MSC: 68Q45 68R10 PDFBibTeX XML
Furtado, A. L.; Mylopoulos, J. Using graph grammars to define sets of digraphs. (English) Zbl 0415.68043 INFOR 17, 242-261 (1979). MSC: 68Q45 05C20 05C45 PDFBibTeX XMLCite \textit{A. L. Furtado} and \textit{J. Mylopoulos}, INFOR 17, 242--261 (1979; Zbl 0415.68043) Full Text: DOI
Meyer auf der Heide, Friedhelm A comparison between two variations of a pebble game on graphs. (English) Zbl 0413.90101 Automata, languages and programming, 6th Colloq., Graz 1979, Lect. Notes Comput. Sci. 71, 413-421 (1979). MSC: 91A24 91A05 05C20 PDFBibTeX XML
Cogis, O.; Habib, M. Nombre de sauts et graphes série-parallèles. (French) Zbl 0413.05013 RAIRO, Inf. Théor. 13, 3-18 (1979). MSC: 05C20 68R10 05-04 PDFBibTeX XMLCite \textit{O. Cogis} and \textit{M. Habib}, RAIRO, Inf. Théor. 13, 3--18 (1979; Zbl 0413.05013) Full Text: EuDML
Ntafos, S. C.; Hakimi, S. Louis On path cover problems in digraphs and applications to program testing. (English) Zbl 0412.68052 IEEE Trans. Software Eng. 5, 520-529 (1979). MSC: 68R10 68Q60 05C20 05C38 68Q25 PDFBibTeX XMLCite \textit{S. C. Ntafos} and \textit{S. L. Hakimi}, IEEE Trans. Softw. Eng. 5, 520--529 (1979; Zbl 0412.68052) Full Text: DOI
Probert, Robert L.; Cheston, Grant A.; Saxton, Lawrence V. Computing minimum path covers for flow graphs of well-structured programs. (English) Zbl 0478.05075 Numerical mathematics and computing, Proc. 7th Manitoba Conf., Winnipeg/Can. 1977, Congr. Numerantium 20, 503-523 (1978). MSC: 05C70 68R10 05C20 68Q60 PDFBibTeX XML
Kesel’man, D. Ya. One contourless orientation of the graph edges. (Russian) Zbl 0418.05029 Kibernetika 1978, No. 2, 83-90 (1978). MSC: 05C20 05C10 PDFBibTeX XMLCite \textit{D. Ya. Kesel'man}, Kibernetika 1978, No. 2, 83--90 (1978; Zbl 0418.05029)