Coverart for item
The Resource Graph-Theoretic Concepts in Computer Science : 17th International Workshop, WG '91 Fischbachau, Germany, June 17–19 1991 Proceedings, edited by Gunther Schmidt, Rudolf Berghammer, (electronic resource)

Graph-Theoretic Concepts in Computer Science : 17th International Workshop, WG '91 Fischbachau, Germany, June 17–19 1991 Proceedings, edited by Gunther Schmidt, Rudolf Berghammer, (electronic resource)

Label
Graph-Theoretic Concepts in Computer Science : 17th International Workshop, WG '91 Fischbachau, Germany, June 17–19 1991 Proceedings
Title
Graph-Theoretic 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
Creator
Contributor
Editor
Provider
Subject
Language
eng
Summary
This volume contains contributions to the 17th International workshop on Graph-Theoretic Concepts in Computer Science (WG '91) held in Southern Bavaria in June 1991. These annual workshops are designed to bring together researchers using graph-theoretic methods to discuss new developments relating to or emerging from a diversity of application fields. The topics covered in this volume include: tree-related problems, graph grammarsand rewriting, complexity, computational geometry, parallel algorithms, vertex orderings, path-oriented algorithms, applications to VLSI, and disjoint cycle problems
Member of
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
Graph-Theoretic Concepts in Computer Science : 17th International Workshop, WG '91 Fischbachau, Germany, June 17–19 1991 Proceedings, edited by Gunther Schmidt, Rudolf Berghammer, (electronic resource)
Instantiates
Publication
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 second-order evaluations on tree-decomposable 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 graph-transformations -- 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/3-540-55121-2
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(DE-He213)978-3-540-46735-9
Label
Graph-Theoretic Concepts in Computer Science : 17th International Workshop, WG '91 Fischbachau, Germany, June 17–19 1991 Proceedings, edited by Gunther Schmidt, Rudolf Berghammer, (electronic resource)
Publication
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 second-order evaluations on tree-decomposable 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 graph-transformations -- 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/3-540-55121-2
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(DE-He213)978-3-540-46735-9

Library Locations

  • African Studies LibraryBorrow it
    771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Alumni Medical LibraryBorrow it
    72 East Concord Street, Boston, MA, 02118, US
    42.336388 -71.072393
  • Astronomy LibraryBorrow it
    725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US
    42.350259 -71.105717
  • Fineman and Pappas Law LibrariesBorrow it
    765 Commonwealth Avenue, Boston, MA, 02215, US
    42.350979 -71.107023
  • Frederick S. Pardee Management LibraryBorrow it
    595 Commonwealth Avenue, Boston, MA, 02215, US
    42.349626 -71.099547
  • Howard Gotlieb Archival Research CenterBorrow it
    771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Mugar Memorial LibraryBorrow it
    771 Commonwealth Avenue, Boston, MA, 02215, US
    42.350723 -71.108227
  • Music LibraryBorrow it
    771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Pikering Educational Resources LibraryBorrow it
    2 Silber Way, Boston, MA, 02215, US
    42.349804 -71.101425
  • School of Theology LibraryBorrow it
    745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350494 -71.107235
  • Science & Engineering LibraryBorrow it
    38 Cummington Mall, Boston, MA, 02215, US
    42.348472 -71.102257
  • Stone Science LibraryBorrow it
    675 Commonwealth Avenue, Boston, MA, 02445, US
    42.350103 -71.103784
Processing Feedback ...