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
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
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)
Las Vergnas, Michel Acyclic and totally cyclic orientations of combinatorial geometries. (English) Zbl 0404.05017 Discrete Math. 20(1977), 51-61 (1978). MSC: 05B35 05B25 05C99 05C20 51D20 PDFBibTeX XMLCite \textit{M. Las Vergnas}, Discrete Math. 20, 51--61 (1978; Zbl 0404.05017) Full Text: DOI