Coverart for item
The Resource Graphtheoretic concepts in computer science : proceedings of the international workshop WG 80, Bad Honnef, June 15-18, 1980, edited by Hartmut Noltemeier

Graphtheoretic concepts in computer science : proceedings of the international workshop WG 80, Bad Honnef, June 15-18, 1980, edited by Hartmut Noltemeier

Label
Graphtheoretic concepts in computer science : proceedings of the international workshop WG 80, Bad Honnef, June 15-18, 1980
Title
Graphtheoretic concepts in computer science
Title remainder
proceedings of the international workshop WG 80, Bad Honnef, June 15-18, 1980
Statement of responsibility
edited by Hartmut Noltemeier
Creator
Contributor
Subject
Genre
Language
eng
Member of
Cataloging source
DLC
Dewey number
511/.5
Index
no index present
LC call number
QA166
LC item number
.G74
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
1980
http://bibfra.me/vocab/lite/meetingName
Fachtagung über Graphentheoretische Konzepte der Informatik
Nature of contents
bibliography
http://library.link/vocab/relatedWorkOrContributorName
Noltemeier, Hartmut
Series statement
Lecture notes in computer science
Series volume
100
http://library.link/vocab/subjectName
  • Graph theory
  • Electronic data processing
  • manipulation graphe
  • grammaire graphe
  • modèle graphe
  • théorie graphe
  • Graphes, Théorie des
  • Informatique
  • Datenverarbeitung
  • Graphentheorie
  • Kongress
  • Computerunterstütztes Verfahren
Label
Graphtheoretic concepts in computer science : proceedings of the international workshop WG 80, Bad Honnef, June 15-18, 1980, edited by Hartmut Noltemeier
Instantiates
Publication
Bibliography note
Includes bibliographies and index
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • Graph rewriting automatic, machine-independent program optimization
  • M. Nagl
  • Properties of ordered graph grammars
  • H.J. Ludwigs
  • The power of a one-dimensional vector of processors
  • J.L. Bently, Th. Ottmann
  • A new data structure for representing sorted lists
  • K. Mehlhorn /
  • On the use of some almost sure graph properties
  • G. Tinhofer
  • The post-office problem and related questions
  • On a generalization of heaps
  • H. Noltemeier
  • Graph grammars and the complexity gap in the isomorphism problem for acyclic digraphs
  • M. Schnitzler
  • Issues in the study of graph embeddings
  • A. L. Rosenberg
  • Schema hypergraphs: a formalism to investigate logical data base design
  • C. Batini, A. D'Arti
  • The use of transitively irreducible kernels of full families of functional dependencies in logical data base design
  • P. Kandzia, M. Mangelmann
  • H. Maurer
  • Graph algorithms for the synthesis and manipulation of data base schemes
  • G. Ausiello, A. D'Atri, D. Saccà
  • The analysis of search trees: a survey
  • Th. Ottmann, H.-W. Six, D. Wood
  • A framework for data structures
  • H.-W. Six
  • Investigating programs in terms of partial graphs
  • G. Schmidt
  • An observation concerning the complexity of problems with few solutions and its application to cryptography
  • S. Even, Y. Yacobi
  • Series of graphs generated by rational machines
  • Bounding the bandwidth of np-complete problems
  • B. Monien, I.H. Sudborough
  • The complexity of path problems in graphs and path systems of bounded bandwidth
  • I.H. Sudborough
  • A comparision [sic] between petri-nets and graph grammars
  • H.-J Kreowski
  • A graph grammar representation of nonsequential processes
  • W. Reisig
  • Reachability homomorphisms on nets
  • J. Perl, J. Ebert
  • H. Nishio
  • A bird's-eye view to path problems
  • B. Mahr
  • The Chinese postman problem for mixed graphs /
  • P. Brucker
  • Alternating cycle covers and paths
  • O. Vornberger
  • Generating all planar 0-, 1-, 2-, 3-connected graphs
  • P. Läuchli
  • Optimal (s,t)-cuts
  • H. Hamacher
  • On linearizing graphs
  • F-factors, perfect matchings and related concepts
  • U. Derigs
  • K.-U. Witt
  • Set-theoretic concepts in programming languages and their implementation
  • J.J. Schneider
Control code
7197477
Dimensions
25 cm
Extent
x, 403 pages
Isbn
9780387102917
Lccn
81000265
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other physical details
illustrations
System control number
(WaOLN)62037
Label
Graphtheoretic concepts in computer science : proceedings of the international workshop WG 80, Bad Honnef, June 15-18, 1980, edited by Hartmut Noltemeier
Publication
Bibliography note
Includes bibliographies and index
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • Graph rewriting automatic, machine-independent program optimization
  • M. Nagl
  • Properties of ordered graph grammars
  • H.J. Ludwigs
  • The power of a one-dimensional vector of processors
  • J.L. Bently, Th. Ottmann
  • A new data structure for representing sorted lists
  • K. Mehlhorn /
  • On the use of some almost sure graph properties
  • G. Tinhofer
  • The post-office problem and related questions
  • On a generalization of heaps
  • H. Noltemeier
  • Graph grammars and the complexity gap in the isomorphism problem for acyclic digraphs
  • M. Schnitzler
  • Issues in the study of graph embeddings
  • A. L. Rosenberg
  • Schema hypergraphs: a formalism to investigate logical data base design
  • C. Batini, A. D'Arti
  • The use of transitively irreducible kernels of full families of functional dependencies in logical data base design
  • P. Kandzia, M. Mangelmann
  • H. Maurer
  • Graph algorithms for the synthesis and manipulation of data base schemes
  • G. Ausiello, A. D'Atri, D. Saccà
  • The analysis of search trees: a survey
  • Th. Ottmann, H.-W. Six, D. Wood
  • A framework for data structures
  • H.-W. Six
  • Investigating programs in terms of partial graphs
  • G. Schmidt
  • An observation concerning the complexity of problems with few solutions and its application to cryptography
  • S. Even, Y. Yacobi
  • Series of graphs generated by rational machines
  • Bounding the bandwidth of np-complete problems
  • B. Monien, I.H. Sudborough
  • The complexity of path problems in graphs and path systems of bounded bandwidth
  • I.H. Sudborough
  • A comparision [sic] between petri-nets and graph grammars
  • H.-J Kreowski
  • A graph grammar representation of nonsequential processes
  • W. Reisig
  • Reachability homomorphisms on nets
  • J. Perl, J. Ebert
  • H. Nishio
  • A bird's-eye view to path problems
  • B. Mahr
  • The Chinese postman problem for mixed graphs /
  • P. Brucker
  • Alternating cycle covers and paths
  • O. Vornberger
  • Generating all planar 0-, 1-, 2-, 3-connected graphs
  • P. Läuchli
  • Optimal (s,t)-cuts
  • H. Hamacher
  • On linearizing graphs
  • F-factors, perfect matchings and related concepts
  • U. Derigs
  • K.-U. Witt
  • Set-theoretic concepts in programming languages and their implementation
  • J.J. Schneider
Control code
7197477
Dimensions
25 cm
Extent
x, 403 pages
Isbn
9780387102917
Lccn
81000265
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other physical details
illustrations
System control number
(WaOLN)62037

Library Locations

    • University of Missouri-St. Louis Libraries DepositoryBorrow it
      2908 Lemone Blvd, Columbia, MO, 65201, US
      38.919360 -92.291620
Processing Feedback ...