<E-Book>
Graphtheoretic Concepts in Computer Science : Proceedings of the International Workshop WG 80 Bad Honnef, June 15-18, 1980 / edited by H Noltemeier
(Lecture Notes in Computer Science. ISSN:16113349 ; 100)
Edition | 1st ed. 1981. |
---|---|
Publisher | (Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer) |
Year | 1981 |
Language | English |
Size | XII, 408 p : online resource |
Authors | Noltemeier, H editor SpringerLink (Online service) |
Subjects | LCSH:Computer science FREE:Theory of Computation |
Notes | 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 HTTP:URL=https://doi.org/10.1007/3-540-10291-4 |
TOC
Hide book details.
E-Book | Location | Media type | Volume | Call No. | Status | Reserve | Comments | ISBN | Printed | Restriction | Designated Book | Barcode No. |
---|---|---|---|---|---|---|---|---|---|---|---|---|
E-Book | オンライン | 電子ブック |
|
Springer eBooks | 9783540384359 |
|
電子リソース |
|
EB00224864 |
Hide details.
Material Type | E-Book |
---|---|
Classification | LCC:QA75.5-76.95 DC23:004.0151 |
ID | 4001088673 |
ISBN | 9783540384359 |