Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    edocfu_9959186247502883
    Format: 1 online resource (XII, 408 p.)
    Edition: 1st ed. 1981.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-38435-9
    Series Statement: Lecture Notes in Computer Science, 100
    Note: Bibliographic Level Mode of Issuance: Monograph , 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. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-10291-4
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages