000 03267nam a22004335i 4500
001 978-3-540-38435-9
003 DE-He213
005 20160624101940.0
007 cr nn 008mamaa
008 121227s1981 gw | s |||| 0|eng d
020 _a9783540384359
_9978-3-540-38435-9
024 7 _a10.1007/3-540-10291-4
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYZG
_2bicssc
072 7 _aCOM037000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aGraphtheoretic Concepts in Computer Science
_h[electronic resource] :
_bProceedings of the International Workshop WG 80 Bad Honnef, June 15–18, 1980 /
_cedited by Hartmut Noltemeier.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1981.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1981.
300 _aXII, 408 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v100
505 0 _aThe 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.
650 0 _aComputer science.
650 1 4 _aComputer Science.
650 2 4 _aComputation by Abstract Devices.
700 1 _aNoltemeier, Hartmut.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540102915
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v100
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-10291-4
942 _2EBK4493
_cEBK
999 _c33787
_d33787