Borrow it
 African Studies Library
 Alumni Medical Library
 Astronomy Library
 Fineman and Pappas Law Libraries
 Frederick S. Pardee Management Library
 Howard Gotlieb Archival Research Center
 Mugar Memorial Library
 Music Library
 Pikering Educational Resources Library
 School of Theology Library
 Science & Engineering Library
 Stone Science Library
The Resource GraphTheoretic Concepts in Computer Science : 17th International Workshop, WG '91 Fischbachau, Germany, June 17–19 1991 Proceedings, edited by Gunther Schmidt, Rudolf Berghammer, (electronic resource)
GraphTheoretic Concepts in Computer Science : 17th International Workshop, WG '91 Fischbachau, Germany, June 17–19 1991 Proceedings, edited by Gunther Schmidt, Rudolf Berghammer, (electronic resource)
Resource Information
The item GraphTheoretic Concepts in Computer Science : 17th International Workshop, WG '91 Fischbachau, Germany, June 17–19 1991 Proceedings, edited by Gunther Schmidt, Rudolf Berghammer, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item GraphTheoretic Concepts in Computer Science : 17th International Workshop, WG '91 Fischbachau, Germany, June 17–19 1991 Proceedings, edited by Gunther Schmidt, Rudolf Berghammer, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
 Summary
 This volume contains contributions to the 17th International workshop on GraphTheoretic Concepts in Computer Science (WG '91) held in Southern Bavaria in June 1991. These annual workshops are designed to bring together researchers using graphtheoretic methods to discuss new developments relating to or emerging from a diversity of application fields. The topics covered in this volume include: treerelated problems, graph grammarsand rewriting, complexity, computational geometry, parallel algorithms, vertex orderings, pathoriented algorithms, applications to VLSI, and disjoint cycle problems
 Language
 eng
 Extent
 VIII, 256 p.
 Contents

 Approximating treewidth, pathwidth, and minimum elimination tree height
 Monadic secondorder evaluations on treedecomposable graphs
 Optimal embedding of complete binary trees into lines and grids
 Graph rewriting systems and their application to network reliability analysis
 Nondeterministic control structures for graph rewriting systems
 A language for generic graphtransformations
 Attributed elementary programmed graph grammars
 The complexity of approximating the class Steiner tree problem
 On complexity of some chain and antichain partition problems
 Tight bounds for the rectangular art gallery problem
 Voronoi diagrams of moving points in the plane
 Using maximal independent sets to solve problems in parallel
 Fast parallel algorithms for coloring random graphs
 Optimal vertex ordering of a graph and its application to symmetry detection
 Edge separators for graphs of bounded genus with applications
 Line digraph iterations and the spread concept—with application to graph theory, fault tolerance, and routing
 A generalized encryption scheme based on random graphs
 Dynamic algorithms for shortest paths in planar graphs
 Complete problems for logspace involving lexicographic first paths in graphs
 A new upper bound on the complexity of the all pairs shortest path problem
 On the crossing number of the hypercube and the cube connected cycles
 Logic arrays for interval indicator functions
 On the broadcast time of the butterfly network
 On disjoint cycles
 Short disjoint cycles in cubic bridgeless graphs
 Isbn
 9783540467359
 Label
 GraphTheoretic Concepts in Computer Science : 17th International Workshop, WG '91 Fischbachau, Germany, June 17–19 1991 Proceedings
 Title
 GraphTheoretic Concepts in Computer Science
 Title remainder
 17th International Workshop, WG '91 Fischbachau, Germany, June 17–19 1991 Proceedings
 Statement of responsibility
 edited by Gunther Schmidt, Rudolf Berghammer
 Language
 eng
 Summary
 This volume contains contributions to the 17th International workshop on GraphTheoretic Concepts in Computer Science (WG '91) held in Southern Bavaria in June 1991. These annual workshops are designed to bring together researchers using graphtheoretic methods to discuss new developments relating to or emerging from a diversity of application fields. The topics covered in this volume include: treerelated problems, graph grammarsand rewriting, complexity, computational geometry, parallel algorithms, vertex orderings, pathoriented algorithms, applications to VLSI, and disjoint cycle problems
 http://library.link/vocab/creatorName
 Schmidt, Gunther
 Image bit depth
 0
 LC call number
 QA76.9.A43
 Literary form
 non fiction
 http://library.link/vocab/relatedWorkOrContributorName

 Berghammer, Rudolf.
 SpringerLink
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 570
 http://library.link/vocab/subjectName

 Computer science
 Logic design
 Data structures (Computer science)
 Computer software
 Combinatorics
 Electronics
 Computer Science
 Algorithm Analysis and Problem Complexity
 Combinatorics
 Computation by Abstract Devices
 Data Structures
 Logic Design
 Electronics and Microelectronics, Instrumentation
 Label
 GraphTheoretic Concepts in Computer Science : 17th International Workshop, WG '91 Fischbachau, Germany, June 17–19 1991 Proceedings, edited by Gunther Schmidt, Rudolf Berghammer, (electronic resource)
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Approximating treewidth, pathwidth, and minimum elimination tree height  Monadic secondorder evaluations on treedecomposable graphs  Optimal embedding of complete binary trees into lines and grids  Graph rewriting systems and their application to network reliability analysis  Nondeterministic control structures for graph rewriting systems  A language for generic graphtransformations  Attributed elementary programmed graph grammars  The complexity of approximating the class Steiner tree problem  On complexity of some chain and antichain partition problems  Tight bounds for the rectangular art gallery problem  Voronoi diagrams of moving points in the plane  Using maximal independent sets to solve problems in parallel  Fast parallel algorithms for coloring random graphs  Optimal vertex ordering of a graph and its application to symmetry detection  Edge separators for graphs of bounded genus with applications  Line digraph iterations and the spread concept—with application to graph theory, fault tolerance, and routing  A generalized encryption scheme based on random graphs  Dynamic algorithms for shortest paths in planar graphs  Complete problems for logspace involving lexicographic first paths in graphs  A new upper bound on the complexity of the all pairs shortest path problem  On the crossing number of the hypercube and the cube connected cycles  Logic arrays for interval indicator functions  On the broadcast time of the butterfly network  On disjoint cycles  Short disjoint cycles in cubic bridgeless graphs
 Dimensions
 unknown
 Extent
 VIII, 256 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540467359
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/3540551212
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540467359
 Label
 GraphTheoretic Concepts in Computer Science : 17th International Workshop, WG '91 Fischbachau, Germany, June 17–19 1991 Proceedings, edited by Gunther Schmidt, Rudolf Berghammer, (electronic resource)
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Approximating treewidth, pathwidth, and minimum elimination tree height  Monadic secondorder evaluations on treedecomposable graphs  Optimal embedding of complete binary trees into lines and grids  Graph rewriting systems and their application to network reliability analysis  Nondeterministic control structures for graph rewriting systems  A language for generic graphtransformations  Attributed elementary programmed graph grammars  The complexity of approximating the class Steiner tree problem  On complexity of some chain and antichain partition problems  Tight bounds for the rectangular art gallery problem  Voronoi diagrams of moving points in the plane  Using maximal independent sets to solve problems in parallel  Fast parallel algorithms for coloring random graphs  Optimal vertex ordering of a graph and its application to symmetry detection  Edge separators for graphs of bounded genus with applications  Line digraph iterations and the spread concept—with application to graph theory, fault tolerance, and routing  A generalized encryption scheme based on random graphs  Dynamic algorithms for shortest paths in planar graphs  Complete problems for logspace involving lexicographic first paths in graphs  A new upper bound on the complexity of the all pairs shortest path problem  On the crossing number of the hypercube and the cube connected cycles  Logic arrays for interval indicator functions  On the broadcast time of the butterfly network  On disjoint cycles  Short disjoint cycles in cubic bridgeless graphs
 Dimensions
 unknown
 Extent
 VIII, 256 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540467359
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/3540551212
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540467359
Subject
 Combinatorics
 Computation by Abstract Devices
 Computer Science
 Computer science
 Computer software
 Data Structures
 Data structures (Computer science)
 Electronic resources
 Electronics
 Electronics and Microelectronics, Instrumentation
 Logic Design
 Logic design
 Algorithm Analysis and Problem Complexity
Member of
Library Locations

African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 71.108227


Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 71.105717

Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 71.107023

Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 71.099547

Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 71.108227


Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 71.108227

Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 71.101425

School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 71.107235

Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 71.102257

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.bu.edu/portal/GraphTheoreticConceptsinComputerScience/W6foDQ1MVD0/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/GraphTheoreticConceptsinComputerScience/W6foDQ1MVD0/">GraphTheoretic Concepts in Computer Science : 17th International Workshop, WG '91 Fischbachau, Germany, June 17–19 1991 Proceedings, edited by Gunther Schmidt, Rudolf Berghammer, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University 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 GraphTheoretic Concepts in Computer Science : 17th International Workshop, WG '91 Fischbachau, Germany, June 17–19 1991 Proceedings, edited by Gunther Schmidt, Rudolf Berghammer, (electronic resource)
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.bu.edu/portal/GraphTheoreticConceptsinComputerScience/W6foDQ1MVD0/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/GraphTheoreticConceptsinComputerScience/W6foDQ1MVD0/">GraphTheoretic Concepts in Computer Science : 17th International Workshop, WG '91 Fischbachau, Germany, June 17–19 1991 Proceedings, edited by Gunther Schmidt, Rudolf Berghammer, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>