000 04460nam a22005775i 4500
001 978-3-540-46076-3
003 DE-He213
005 20160624102011.0
007 cr nn 008mamaa
008 121227s1989 gw | s |||| 0|eng d
020 _a9783540460763
_9978-3-540-46076-3
024 7 _a10.1007/3-540-50728-0
_2doi
050 4 _aQA164-167.2
072 7 _aPBV
_2bicssc
072 7 _aMAT036000
_2bisacsh
082 0 4 _a511.6
_223
245 1 0 _aGraph-Theoretic Concepts in Computer Science
_h[electronic resource] :
_bInternational Workshop WG '88 Amsterdam, The Netherlands, June 15–17, 1988 Proceedings /
_cedited by J. Leeuwen.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1989.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1989.
300 _aX, 462 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 ;
_v344
505 0 _aNC-algorithms for graphs with small treewidth -- Graph-theoretic properties compatible with graph derivations -- The monadic second-order logic of graphs : Definable sets of finite graphs -- On systems of equations defining infinite graphs -- Fault tolerant networks of specified diameter -- DFS tree construction: Algorithms and characterizations -- Serializable graphs -- Transitive closure algorithms for very large databases -- A graph-based decomposition approach for recursive query processing -- Construction of deterministic transition graphs from dynamic integrity constraints -- (Time × space)-efficient implementations of hlerarchical conceptual models -- Dominance in the presence of obstacles -- Separating a polyhedron by one translation from a set of obstacles -- Linear time algorithms for testing approximate congruence in the plane -- Moving regular k-gons in contact -- Epsilon-nets for halfplanes -- Greedy triangulation can be efficiently implemented in the average case -- A simple systolic method to find all bridges of an undirected graph -- Colouring perfect planar graphs in parallel -- An efficient parallel algorithm for the all pairs shortest path problem -- A parallel algorithm for channel routing -- Application of graph theory to topology generation for logic gates -- On the estimate of the size of a directed graph -- The average size of ordered binary subgraphs -- O(n2) algorithms for graph planarization -- Bandwidth and profile minimization -- On the spanning trees of weighted graphs -- On paths in search or decision trees which require almost worst-case time -- A time-optimal parallel algorithm for the computing of Voronoi-diagrams -- Voronoi diagrams in the moscow metric -- A sweep algorithm and its implementation: The all-nearest-neighbors problem revisited.
520 _aThis volume presents the proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '88), held from June 15 to 17, 1988 in Amsterdam, The Netherlands. It contains 31 papers on new or current developments in the area of graph-based algorithms. The topics covered include e.g. structural graph theory, parallel graph algorithms, graph-based modeling (in database theory and VLSI), computational geometry and applied graph theory. The book contains the revised versions of all the papers presented at the workshop. The revisions are based on comments and suggestions received by the authors during and after the workshop.
650 0 _aMathematics.
650 0 _aOperating systems (Computers).
650 0 _aData structures (Computer science).
650 0 _aComputer software.
650 0 _aDatabase management.
650 0 _aComputer graphics.
650 0 _aCombinatorics.
650 1 4 _aMathematics.
650 2 4 _aCombinatorics.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aData Structures.
650 2 4 _aComputer Graphics.
650 2 4 _aOperating Systems.
650 2 4 _aDatabase Management.
700 1 _aLeeuwen, J.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540507284
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v344
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-50728-0
942 _2EBK5687
_cEBK
999 _c34981
_d34981