000 04612nam a22006255i 4500
001 978-3-540-68072-7
003 DE-He213
005 20240423132547.0
007 cr nn 008mamaa
008 121227s1997 gw | s |||| 0|eng d
020 _a9783540680727
_9978-3-540-68072-7
024 7 _a10.1007/3-540-62559-3
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aGraph-Theoretic Concepts in Computer Science
_h[electronic resource] :
_b22nd International Workshop, WG '96, Cadenabbia, Italy, June 12-14, 1996, Proceedings /
_cedited by Fabrizio D'Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela.
250 _a1st ed. 1997.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1997.
300 _aXII, 416 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,
_x1611-3349 ;
_v1197
505 0 _aHypergraphs and decision trees -- Improved approximations of independent dominating set in bounded degree graphs -- A new characterization of P 4-connected graphs -- Node rewriting in hypergraphs -- On ?-partitioning the n-cube -- Embedding complete binary trees in product graphs -- Clique and anticlique partitions of graphs -- Optimal parallel routing in star graphs -- Counting edges in a dag -- Closure properties of context-free Hyperedge Replacement Systems -- Upward drawings of search trees -- More general parallel tree contraction: Register allocation and broadcasting in a tree -- System diagnosis with smallest risk of error -- Efficient algorithms for shortest path queries in planar digraphs -- LexBFS-orderings and powers of graphs -- Efficient Union-Find for planar graphs and other sparse graph classes -- Switchbox routing in VLSI design: Closing the complexity gap -- Detecting diamond necklaces in labeled dags -- Algebraic graph derivations for graphical calculi -- Definability equals recognizability of partial 3-trees -- One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs -- Approximate maxima finding of continuous functions under restricted budget (Extended abstract) -- The Optimal Cost Chromatic Partition problem for trees and interval graphs -- Modifying networks to obtain low cost trees -- On the hardness of allocating frequencies for hybrid networks -- Homogeneous sets and domination problems -- Independent spanning trees of product graphs -- Designing distrance-preserving fault-tolerant topologies -- Shortest path algorithms for nearly acyclic directed graphs -- Computing disjoint paths with length constraints -- Generalized edge-rankings of trees.
520 _aThis book constitutes the carefully refereed post-proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG '96, held in Cadenabbia, Italy, in June 1996. The 30 revised full papers presented in the volume were selected from a total of 65 submissions. This collection documents the state of the art in the area. Among the topics addressed are graph algorithms, graph rewriting, hypergraphs, graph drawing, networking, approximation and optimization, trees, graph computation, and others.
650 0 _aComputer science.
650 0 _aMathematics.
650 0 _aAlgorithms.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aComputer graphics.
650 1 4 _aTheory of Computation.
650 2 4 _aApplications of Mathematics.
650 2 4 _aAlgorithms.
650 2 4 _aData Science.
650 2 4 _aComputer Graphics.
700 1 _aD'Amore, Fabrizio.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aFranciosa, Paolo Giulio.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMarchetti-Spaccamela, Alberto.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540625599
776 0 8 _iPrinted edition:
_z9783662177990
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1197
856 4 0 _uhttps://doi.org/10.1007/3-540-62559-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c189121
_d189121