Data Portal @ linkeddatafragments.org

Matches in Harvard for { <http://id.lib.harvard.edu/aleph/000523410/catalog> ?p ?o. }

• catalog contributor b643705.
• catalog contributor b643706.
• catalog created "c1985.".
• catalog date "1985".
• catalog date "c1985.".
• catalog dateCopyrighted "c1985.".
• catalog description "Compatible matchings in bipartite graphs / C.P. Kruskal and D.B. West -- A linear time algorithm for finding an optimal dominating subforest of a tree / E.L. Lawler and P.J. Slater -- Toward a measure of vulnerability II. The ratio of disruption / M.J. Lipman and R.E. Pippert -- Cubic graphs and the four-color theorem / F. Loupekine and J.J. Watkins -- An effective approach to some practical capacitated tree problems / V.V. Malyshko -- Concurrent flow and concurrent connectivity in graphs / D.W. Matula -- A linear algorithm for topological bandwidth in degree three trees / Z. Miller -- Generalized colorings of graphs / C.M. Mynhardt and I. Broere -- An upper bound on the chromatic index of multigraphs / T. Nishizeki and K. Kashiwagi -- Bandwidths and profiles of trees / A.M. Odlyzko and H.S. Wilf -- 2-super-universal graphs / J. Pach and L. Surányi -- An efficient algorithm for embedding graphs in the projective plane / B. Peruničić and Z. Durić -- Toward a measure of vulnerability I. The edge-connectivity vector / R.E. Pippert and M.J. Lipman -- Some results on automorphisms of ordered relational systems and the theory of scale type in measurement / F.S. Roberts and Z. Rosenbaum -- Counting strongly connected finite automata / R.W. Robinson -- Some extensions of Ore's theorem / E. Schmeichel and D. Hayes -- Packing a tree of order p with a (p, p) graph / S. Schuster -- How many rinds can a finite sequence of pairs have? / A.J. Schwenk -- Iterative algorithms for calculating network reliability / D.R. Shier -- Shortest path algorithms / R.E. Tarjan -- The binding number of lexicographic products of graphs / J. Wang, S. Tian and J. Liu -- Spanning trees in program flowgraphs / R.W. Whitty -- Analysis situs / R.J. Wilson -- On graphs which are metric spaces of negative type / P.M. Winkler.".
• catalog description "Includes bibliographies.".
• catalog description "M.A. Fiol, I. Algegre, J.L.A. Yebra and J. Fábrega -- Application of numbered graphs in the design of multi-stage telecommand codes / S. Gansean and M.O. Ahmad -- The cochromatic number of graphs in a switching sequence / J. Gimbel -- A recursive algorithm for Hamiltonian cycles in the (1,j, n)-Cayley graph of the alternating group / R.J. Gould and R.L. Roth -- Further results on a generalization of edge-coloring / S.L. Hakimi -- The directed Shannon switching game and the one-way game / Y.O. Hamidoune and M. Las Vergnas -- Graph theoretic approaches to finite mathematical structures / F. Harary -- Drawings of graphs and multiple crossings / H. Harborth -- Domination in trees: models and algorithms / S. Hedetniemi, S. Hedetniemi and R. Laskar -- Connected planar graphs with three or more orbits / J.P. Hutchingson and L.B. Krompart -- Relating metrics, lines and variables defined on graphs to problems in medicinal chemistry / M. Johnson --".
• catalog description "The Ramsey number for the pair complete bipartite graph-graph of limited degree / S.A. Burr, P. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp -- Embedding graphs in books: a layout problem with applications to VLSI design / F.R.K. Chung, F.T. Leighton, and A.L. Rosenberg -- Hamilton cycles and quotients of bipartite graphs / I.J. Dejter -- Problems and results on chromatic numbers in finite and infinite graphs / P. Erdös -- Supraconvergence and functions that sum to zero on cycles / V. Faber and A.B. White -- Edge-disjoint Hamiltonian cycles / R.J. Faudree, C.C. Rousseau and R.H. Schelp -- Studies related to the Ramsey number r(K₅-e) / R.J. raudree, C.D. Rousseau and R.H. Schelp -- The structral complexity of flowgraphs / N.E. Fenton -- N-domination in graphs / J.F. Fink and M.S. Jacobson -- On n-domination, n-dependence and forbidden subgraphs / J.F. Fink and M.S. Jacobson -- Digraphs with walks of equal length between vertices /".
• catalog description "Tiling finite figures consisting of regular polygons / J. Akiyama, M. Kano, and M.-J. Ruiz -- Eigenvalues, geometric expanders and sorting in rounds / N. Alon -- Long path enumeration algorithms for timing verification on large digital systems / T. Asano and S. Sato -- On upsets in bipartite tournaments / K.S. Bagga -- Some results on binary matrices obtained via bipartite tournaments / K.S. Bagga and L.W. Beineke -- Partitioning the nodes of a graph / E.R. Barnes -- A graph theoretical characterization of minimal deadlocks in petri nets / J.-C. Bermond and G. Memmi -- On graceful directed graphs that are computational models of some algebraic systems / G.S. Bloom and D.F. Hsu -- The cut frequency vector / F.T. Boesch -- Diameter vulnerability in networks / J. Bond and C. Peyrat -- Generalized colorings of outerplanar and planar graphs / I. Broere and C.M. Mynhardt --".
• catalog description "[a, b]-factorizations of nearly bipartite graphs / M. Kano -- The complexity of pebbling for two classes of graphs / M.M. Klawe.".
• catalog extent "xv, 810 p. :".
• catalog hasFormat "Graph theory with applications to algorithms and computer science.".
• catalog identifier "0471816353 :".
• catalog isFormatOf "Graph theory with applications to algorithms and computer science.".
• catalog issued "1985".
• catalog issued "c1985.".
• catalog language "eng".
• catalog publisher "New York : Wiley,".
• catalog relation "Graph theory with applications to algorithms and computer science.".
• catalog subject "Algorithms Congresses.".
• catalog subject "Computer algorithms Congresses.".
• catalog subject "Graph theory Congresses.".
• catalog subject "Graph theory Data processing Congresses.".
• catalog subject "QA166 .G733 1985".
• catalog tableOfContents "Compatible matchings in bipartite graphs / C.P. Kruskal and D.B. West -- A linear time algorithm for finding an optimal dominating subforest of a tree / E.L. Lawler and P.J. Slater -- Toward a measure of vulnerability II. The ratio of disruption / M.J. Lipman and R.E. Pippert -- Cubic graphs and the four-color theorem / F. Loupekine and J.J. Watkins -- An effective approach to some practical capacitated tree problems / V.V. Malyshko -- Concurrent flow and concurrent connectivity in graphs / D.W. Matula -- A linear algorithm for topological bandwidth in degree three trees / Z. Miller -- Generalized colorings of graphs / C.M. Mynhardt and I. Broere -- An upper bound on the chromatic index of multigraphs / T. Nishizeki and K. Kashiwagi -- Bandwidths and profiles of trees / A.M. Odlyzko and H.S. Wilf -- 2-super-universal graphs / J. Pach and L. Surányi -- An efficient algorithm for embedding graphs in the projective plane / B. Peruničić and Z. Durić -- Toward a measure of vulnerability I. The edge-connectivity vector / R.E. Pippert and M.J. Lipman -- Some results on automorphisms of ordered relational systems and the theory of scale type in measurement / F.S. Roberts and Z. Rosenbaum -- Counting strongly connected finite automata / R.W. Robinson -- Some extensions of Ore's theorem / E. Schmeichel and D. Hayes -- Packing a tree of order p with a (p, p) graph / S. Schuster -- How many rinds can a finite sequence of pairs have? / A.J. Schwenk -- Iterative algorithms for calculating network reliability / D.R. Shier -- Shortest path algorithms / R.E. Tarjan -- The binding number of lexicographic products of graphs / J. Wang, S. Tian and J. Liu -- Spanning trees in program flowgraphs / R.W. Whitty -- Analysis situs / R.J. Wilson -- On graphs which are metric spaces of negative type / P.M. Winkler.".
• catalog tableOfContents "M.A. Fiol, I. Algegre, J.L.A. Yebra and J. Fábrega -- Application of numbered graphs in the design of multi-stage telecommand codes / S. Gansean and M.O. Ahmad -- The cochromatic number of graphs in a switching sequence / J. Gimbel -- A recursive algorithm for Hamiltonian cycles in the (1,j, n)-Cayley graph of the alternating group / R.J. Gould and R.L. Roth -- Further results on a generalization of edge-coloring / S.L. Hakimi -- The directed Shannon switching game and the one-way game / Y.O. Hamidoune and M. Las Vergnas -- Graph theoretic approaches to finite mathematical structures / F. Harary -- Drawings of graphs and multiple crossings / H. Harborth -- Domination in trees: models and algorithms / S. Hedetniemi, S. Hedetniemi and R. Laskar -- Connected planar graphs with three or more orbits / J.P. Hutchingson and L.B. Krompart -- Relating metrics, lines and variables defined on graphs to problems in medicinal chemistry / M. Johnson --".
• catalog tableOfContents "The Ramsey number for the pair complete bipartite graph-graph of limited degree / S.A. Burr, P. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp -- Embedding graphs in books: a layout problem with applications to VLSI design / F.R.K. Chung, F.T. Leighton, and A.L. Rosenberg -- Hamilton cycles and quotients of bipartite graphs / I.J. Dejter -- Problems and results on chromatic numbers in finite and infinite graphs / P. Erdös -- Supraconvergence and functions that sum to zero on cycles / V. Faber and A.B. White -- Edge-disjoint Hamiltonian cycles / R.J. Faudree, C.C. Rousseau and R.H. Schelp -- Studies related to the Ramsey number r(K₅-e) / R.J. raudree, C.D. Rousseau and R.H. Schelp -- The structral complexity of flowgraphs / N.E. Fenton -- N-domination in graphs / J.F. Fink and M.S. Jacobson -- On n-domination, n-dependence and forbidden subgraphs / J.F. Fink and M.S. Jacobson -- Digraphs with walks of equal length between vertices /".
• catalog tableOfContents "Tiling finite figures consisting of regular polygons / J. Akiyama, M. Kano, and M.-J. Ruiz -- Eigenvalues, geometric expanders and sorting in rounds / N. Alon -- Long path enumeration algorithms for timing verification on large digital systems / T. Asano and S. Sato -- On upsets in bipartite tournaments / K.S. Bagga -- Some results on binary matrices obtained via bipartite tournaments / K.S. Bagga and L.W. Beineke -- Partitioning the nodes of a graph / E.R. Barnes -- A graph theoretical characterization of minimal deadlocks in petri nets / J.-C. Bermond and G. Memmi -- On graceful directed graphs that are computational models of some algebraic systems / G.S. Bloom and D.F. Hsu -- The cut frequency vector / F.T. Boesch -- Diameter vulnerability in networks / J. Bond and C. Peyrat -- Generalized colorings of outerplanar and planar graphs / I. Broere and C.M. Mynhardt --".
• catalog tableOfContents "[a, b]-factorizations of nearly bipartite graphs / M. Kano -- The complexity of pebbling for two classes of graphs / M.M. Klawe.".
• catalog title "Graph theory with applications to algorithms and computer science / edited by Y. Alavi ... [et al.].".
• catalog type "Conference proceedings. fast".
• catalog type "Kalamazoo (Mich., 1984) swd".
• catalog type "text".