Graphtheoretic Concepts in Computer Science [electronic resource] : Proceedings of the International Workshop WG 80 Bad Honnef, June 15–18, 1980 / edited by Hartmut Noltemeier.
Material type: TextSeries: Lecture Notes in Computer Science ; 100Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1981Description: XII, 408 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540384359Subject(s): Computer science | Computer Science | Computation by Abstract DevicesAdditional physical formats: Printed edition:: No titleDDC classification: 004.0151 LOC classification: QA75.5-76.95Online resources: Click here to access onlineCurrent library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
IMSc Library | IMSc Library | Link to resource | Available | EBK4493 |
The post-office problem and related questions -- Series of graphs generated by rational machines -- On linearizing graphs -- Set-theoretic concepts in programming languages and their implementation -- Graph rewriting and automatic, machine-independent program optimization -- Properties of ordered graph grammars -- The power of a one-dimensional vector of processors -- A new data structure for representing sorted lists -- On the use of some almost sure graph properties -- On a generalization of heaps -- Graph grammars and the complexity gap in the isomorphism problem for acyclic digraphs -- Issues in the study of graph embeddings -- Schema hypergraphs:A formalism to investigate logical data base design -- The use of transitively irreducible kernels of full families of functional dependencies in logical data base design -- Graph algorithms for the synthesis and manipulation of data base schemes -- The analysis of search trees: A survey -- A framework for data structures -- Investigating programs in terms of partial graphs -- An observation concerning the complexity of problems with few solutions and its application to cryptography -- Bounding the bandwidth of NP-complete problems -- The complexity of path problems in graphs and path systems of bounded bandwidth -- A comparison between petri-nets and graph grammars -- A graph grammar representation of nonsequential processes -- Reachability homomorphisms on nets -- A birds eye view to path problems -- The chinese postman problem for mixed graphs -- Alternating cycle covers and paths -- Generating all planar 0-,1-,2-,3-connected graphs -- Optimal (s,t)-cuts -- F-factors, perfect matchings and related concepts.
There are no comments on this title.