The Resource Graph theory with applications to algorithms and computer science, edited by Y. Alavi [and others]
Graph theory with applications to algorithms and computer science, edited by Y. Alavi [and others]
Resource Information
The item Graph theory with applications to algorithms and computer science, edited by Y. Alavi [and others] represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of MissouriSt. Louis Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Graph theory with applications to algorithms and computer science, edited by Y. Alavi [and others] represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of MissouriSt. Louis Libraries.
This item is available to borrow from 1 library branch.
 Language
 eng
 Extent
 xv, 810 pages
 Note

 "Proceedings of the Fifth Quadrennial International Conference on the Theory and Applications of Graphs with special emphasis on algorithms and computer science applications, held at Western Michigan University in Kalamazoo, Michigan, June 48, 1984"Pref
 "A WileyInterscience publication."
 Contents

 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
 Tiling finite figures consisting of regular polygons
 Diameter vulnerability in networks
 J. Bond and C. Peyrat
 Generalized colorings of outerplanar and planar graphs
 I. Broere and C.M. Mynhardt
 The Ramsey number for the pair complete bipartite graphgraph 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
 J. Akiyama, M. Kano, and M.J. Ruiz
 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
 Edgedisjoint Hamiltonian cycles
 R.J. Faudree, C.C. Rousseau and R.H. Schelp
 Studies related to the Ramsey number r(K5e)
 R.J. raudree, C.D. Rousseau and R.H. Schelp
 The structural complexity of flowgraphs
 N.E. Fenton
 Eigenvalues, geometric expanders and sorting in rounds
 Ndomination in graphs
 J.F. Fink and M.S. Jacobson
 On ndomination, ndependence and forbidden subgraphs
 J.F. Fink and M.S. Jacobson
 Digraphs with walks of equal length between vertices
 M.A. Fiol, I. Algegre, J.L.A. Yebra and J. Fábrega
 Application of numbered graphs in the design of multistage telecommand codes
 S. Gansean and M.O. Ahmad
 The cochromatic number of graphs in a switching sequence
 J. Gimbel
 N. Alon
 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 edgecoloring
 S.L. Hakimi
 The directed Shannon switching game and the oneway 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
 Long path enumeration algorithms for timing verification on large digital systems
 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
 [a,b]factorizations of nearly bipartite graphs
 M. Kano
 The complexity of pebbling for two classes of graphs
 M.M. Klawe 
 T. Asano and S. Sato
 On upsets in bipartite tournaments
 K.S. Bagga
 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
 Compatible matchings in bipartite graphs
 Bandwidths and profiles of trees
 A.M. Odlyzko and H.S. Wilf
 2superuniversal 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 edgeconnectivity 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
 C.P. Kruskal and D.B. West
 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
 A linear time algorithm for finding an optimal dominating subforest of a tree
 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
 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 fourcolor theorem
 F. Loupekine and J.J. Watkins
 Isbn
 9780471816355
 Label
 Graph theory with applications to algorithms and computer science
 Title
 Graph theory with applications to algorithms and computer science
 Statement of responsibility
 edited by Y. Alavi [and others]
 Subject

 Algorithmes  Congrès
 Computer algorithms  Congresses
 Conference papers and proceedings
 Graph theory  Congresses
 Graph theory  Data processing  Congresses
 Graph theory  Applications.
 Graphentheorie
 Graphes, Théorie des  Congrès
 Graphes, Théorie des  Informatique  Congrès
 Kalamazoo (Mich., 1984)
 Kongress
 Language
 eng
 Cataloging source
 DLC
 Dewey number
 511/.5/024
 Illustrations
 illustrations
 Index
 no index present
 LC call number
 QA166
 LC item number
 .G733 1985
 Literary form
 non fiction
 Nature of contents
 bibliography
 http://library.link/vocab/relatedWorkOrContributorDate
 1984
 http://library.link/vocab/relatedWorkOrContributorName

 Alavi, Y
 International Conference on the Theory and Applications of Graphs
 http://library.link/vocab/subjectName

 Graph theory
 Computer algorithms
 Graph theory
 Graphes, Théorie des
 Algorithmes
 Graphes, Théorie des
 Graphentheorie
 Kongress
 Label
 Graph theory with applications to algorithms and computer science, edited by Y. Alavi [and others]
 Note

 "Proceedings of the Fifth Quadrennial International Conference on the Theory and Applications of Graphs with special emphasis on algorithms and computer science applications, held at Western Michigan University in Kalamazoo, Michigan, June 48, 1984"Pref
 "A WileyInterscience publication."
 Bibliography note
 Includes bibliographies
 Carrier category
 volume
 Carrier category code

 nc
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents

 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
 Tiling finite figures consisting of regular polygons
 Diameter vulnerability in networks
 J. Bond and C. Peyrat
 Generalized colorings of outerplanar and planar graphs
 I. Broere and C.M. Mynhardt
 The Ramsey number for the pair complete bipartite graphgraph 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
 J. Akiyama, M. Kano, and M.J. Ruiz
 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
 Edgedisjoint Hamiltonian cycles
 R.J. Faudree, C.C. Rousseau and R.H. Schelp
 Studies related to the Ramsey number r(K5e)
 R.J. raudree, C.D. Rousseau and R.H. Schelp
 The structural complexity of flowgraphs
 N.E. Fenton
 Eigenvalues, geometric expanders and sorting in rounds
 Ndomination in graphs
 J.F. Fink and M.S. Jacobson
 On ndomination, ndependence and forbidden subgraphs
 J.F. Fink and M.S. Jacobson
 Digraphs with walks of equal length between vertices
 M.A. Fiol, I. Algegre, J.L.A. Yebra and J. Fábrega
 Application of numbered graphs in the design of multistage telecommand codes
 S. Gansean and M.O. Ahmad
 The cochromatic number of graphs in a switching sequence
 J. Gimbel
 N. Alon
 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 edgecoloring
 S.L. Hakimi
 The directed Shannon switching game and the oneway 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
 Long path enumeration algorithms for timing verification on large digital systems
 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
 [a,b]factorizations of nearly bipartite graphs
 M. Kano
 The complexity of pebbling for two classes of graphs
 M.M. Klawe 
 T. Asano and S. Sato
 On upsets in bipartite tournaments
 K.S. Bagga
 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
 Compatible matchings in bipartite graphs
 Bandwidths and profiles of trees
 A.M. Odlyzko and H.S. Wilf
 2superuniversal 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 edgeconnectivity 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
 C.P. Kruskal and D.B. West
 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
 A linear time algorithm for finding an optimal dominating subforest of a tree
 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
 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 fourcolor theorem
 F. Loupekine and J.J. Watkins
 Control code
 12135473
 Dimensions
 24 cm
 Extent
 xv, 810 pages
 Isbn
 9780471816355
 Lccn
 85009565
 Media category
 unmediated
 Media MARC source
 rdamedia
 Media type code

 n
 Other physical details
 illustrations
 System control number
 (WaOLN)763758
 Label
 Graph theory with applications to algorithms and computer science, edited by Y. Alavi [and others]
 Note

 "Proceedings of the Fifth Quadrennial International Conference on the Theory and Applications of Graphs with special emphasis on algorithms and computer science applications, held at Western Michigan University in Kalamazoo, Michigan, June 48, 1984"Pref
 "A WileyInterscience publication."
 Bibliography note
 Includes bibliographies
 Carrier category
 volume
 Carrier category code

 nc
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents

 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
 Tiling finite figures consisting of regular polygons
 Diameter vulnerability in networks
 J. Bond and C. Peyrat
 Generalized colorings of outerplanar and planar graphs
 I. Broere and C.M. Mynhardt
 The Ramsey number for the pair complete bipartite graphgraph 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
 J. Akiyama, M. Kano, and M.J. Ruiz
 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
 Edgedisjoint Hamiltonian cycles
 R.J. Faudree, C.C. Rousseau and R.H. Schelp
 Studies related to the Ramsey number r(K5e)
 R.J. raudree, C.D. Rousseau and R.H. Schelp
 The structural complexity of flowgraphs
 N.E. Fenton
 Eigenvalues, geometric expanders and sorting in rounds
 Ndomination in graphs
 J.F. Fink and M.S. Jacobson
 On ndomination, ndependence and forbidden subgraphs
 J.F. Fink and M.S. Jacobson
 Digraphs with walks of equal length between vertices
 M.A. Fiol, I. Algegre, J.L.A. Yebra and J. Fábrega
 Application of numbered graphs in the design of multistage telecommand codes
 S. Gansean and M.O. Ahmad
 The cochromatic number of graphs in a switching sequence
 J. Gimbel
 N. Alon
 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 edgecoloring
 S.L. Hakimi
 The directed Shannon switching game and the oneway 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
 Long path enumeration algorithms for timing verification on large digital systems
 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
 [a,b]factorizations of nearly bipartite graphs
 M. Kano
 The complexity of pebbling for two classes of graphs
 M.M. Klawe 
 T. Asano and S. Sato
 On upsets in bipartite tournaments
 K.S. Bagga
 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
 Compatible matchings in bipartite graphs
 Bandwidths and profiles of trees
 A.M. Odlyzko and H.S. Wilf
 2superuniversal 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 edgeconnectivity 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
 C.P. Kruskal and D.B. West
 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
 A linear time algorithm for finding an optimal dominating subforest of a tree
 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
 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 fourcolor theorem
 F. Loupekine and J.J. Watkins
 Control code
 12135473
 Dimensions
 24 cm
 Extent
 xv, 810 pages
 Isbn
 9780471816355
 Lccn
 85009565
 Media category
 unmediated
 Media MARC source
 rdamedia
 Media type code

 n
 Other physical details
 illustrations
 System control number
 (WaOLN)763758
Subject
 Algorithmes  Congrès
 Computer algorithms  Congresses
 Conference papers and proceedings
 Graph theory  Congresses
 Graph theory  Data processing  Congresses
 Graph theory  Applications.
 Graphentheorie
 Graphes, Théorie des  Congrès
 Graphes, Théorie des  Informatique  Congrès
 Kalamazoo (Mich., 1984)
 Kongress
Genre
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.umsl.edu/portal/Graphtheorywithapplicationstoalgorithmsand/qDsFhd8yl2s/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.umsl.edu/portal/Graphtheorywithapplicationstoalgorithmsand/qDsFhd8yl2s/">Graph theory with applications to algorithms and computer science, edited by Y. Alavi [and others]</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.umsl.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.umsl.edu/">University of MissouriSt. Louis Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Graph theory with applications to algorithms and computer science, edited by Y. Alavi [and others]
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.umsl.edu/portal/Graphtheorywithapplicationstoalgorithmsand/qDsFhd8yl2s/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.umsl.edu/portal/Graphtheorywithapplicationstoalgorithmsand/qDsFhd8yl2s/">Graph theory with applications to algorithms and computer science, edited by Y. Alavi [and others]</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.umsl.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.umsl.edu/">University of MissouriSt. Louis Libraries</a></span></span></span></span></div>