000 04516nam a22006135i 4500
001 978-3-540-46784-7
003 DE-He213
005 20240423132603.0
007 cr nn 008mamaa
008 121227s1999 gw | s |||| 0|eng d
020 _a9783540467847
_9978-3-540-46784-7
024 7 _a10.1007/3-540-46784-X
_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] :
_b25th International Workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 Proceedings /
_cedited by Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz.
250 _a1st ed. 1999.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1999.
300 _aXI, 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 ;
_v1665
505 0 _aSilver Graphs: Achievements and New Challenges -- Online Algorithms: A Study of Graph-Theoretic Concepts -- Discrete Optimization Methods for Packing Problems in Two and Three Dimensions — With Applications in the Textile and Car Manufacturing Industries -- Informatica, Scuola, Communità: Uno Sguardo dall’ Occhio del Ciclone -- Proximity-Preserving Labeling Schemes and Their Applications -- Euler Is Standing in Line -- Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2 -- Complexity Classification of Some Edge Modification Problems -- On Minimum Diameter Spanning Trees under Reload Costs -- Induced Matchings in Regular Graphs and Trees -- Mod-2 Independence and Domination in Graphs -- NLC2-Decomposition in Polynomial Time -- On the Nature of Structure and Its Identification -- On the Clique—Width of Perfect Graph Classes -- An Improved Algorithm for Finding Tree Decompositions of Small Width -- Efficient Analy sis of Graphs with Small Minimal Separators -- Generating All the Minimal Separators of a Graph -- Two Broadcasting Problems in FaultyHypercubes -- Routing Permutations in the Hypercube -- An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs -- Optimal Irreversible Dy namos in Chordal Rings -- Recognizing Bipartite Incident-Graphs of Circulant Digraphs -- Optimal Cuts for Powers of the Petersen Graph -- Dihamiltonian Decomposition of Regular Graphs with Degree Three -- Box-Rectangular Drawings of Plane Graphs -- A Multi-Scale Algorithm for Drawing Graphs Nicely -- All Separating Triangles in a Plane Graph Can Be Optimally “Broken” in Poly nomial Time -- Linear Orderings of Random Geometric Graphs -- Finding Smallest Supertrees Under Minor Containment -- Vertex Cover: Further Observations and Further Improvements -- On the Hardness ofRecognizing Bundles in Time Table Graphs -- Optimal Solutions for Frequency Assignment Problems via Tree Decomposition -- Fixed-Parameter Complexity of ?-Labelings -- Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)—Free Graphs -- On Claw-Free Asteroidal Triple-Free Graphs -- Vertex Partitioning of Crown-Free Interval Graphs -- Triangulated Neighbourhoods in C 4-Free Berge Graphs.
650 0 _aComputer science.
650 0 _aAlgorithms.
650 0 _aDiscrete mathematics.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aComputer graphics.
650 1 4 _aTheory of Computation.
650 2 4 _aAlgorithms.
650 2 4 _aDiscrete Mathematics.
650 2 4 _aData Science.
650 2 4 _aComputer Graphics.
700 1 _aWidmayer, Peter.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aNeyer, Gabriele.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aEidenbenz, Stephan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540667315
776 0 8 _iPrinted edition:
_z9783662173169
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1665
856 4 0 _uhttps://doi.org/10.1007/3-540-46784-X
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c189421
_d189421