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
Contributor
Subject
Genre
Language
eng
Member of
Cataloging source
DLC
Index
index present
LC call number
QA166
LC item number
.G74
Literary form
non fiction
Nature of contents
bibliography
http://library.link/vocab/relatedWorkOrContributorName
Noltemeier, Hartmut
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
  • Electronic data processing
  • Graph theory
  • Datenverarbeitung
  • Graphentheorie
  • Kongress
  • Computerunterstütztes Verfahren
  • grammaire graphe
  • manipulation graphe
  • modèle graphe
  • théorie graphe
  • Computerunterstütztes Verfahren
  • Datenverarbeitung
  • Graphentheorie
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
Dimensions
25 cm.
Extent
x, 403 pages
Isbn
9783540102915
Lccn
81000265
Media category
unmediated
Media MARC source
rdamedia
Media type code
n
Other physical details
illustrations
System control number
  • (OCoLC)07197477
  • (OCoLC)ocm07197477
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
Dimensions
25 cm.
Extent
x, 403 pages
Isbn
9783540102915
Lccn
81000265
Media category
unmediated
Media MARC source
rdamedia
Media type code
n
Other physical details
illustrations
System control number
  • (OCoLC)07197477
  • (OCoLC)ocm07197477

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 ...