000 06061nam a22006495i 4500
001 978-3-540-74839-7
003 DE-He213
005 20240730190458.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540748397
_9978-3-540-74839-7
024 7 _a10.1007/978-3-540-74839-7
_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] :
_b33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007, Revised Papers /
_cedited by Andreas Brandstädt, Dieter Kratsch, Haiko Müller.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aXIII, 344 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4769
505 0 _aComputational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs -- Recognizing Bipartite Tolerance Graphs in Linear Time -- Graph Searching in a Crime Wave -- Monotonicity of Non-deterministic Graph Searching -- Tree-Width and Optimization in Bounded Degree Graphs -- On Restrictions of Balanced 2-Interval Graphs -- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions -- The Clique-Width of Tree-Power and Leaf-Power Graphs -- NLC-2 Graph Recognition and Isomorphism -- A Characterisation of the Minimal Triangulations of Permutation Graphs -- The 3-Steiner Root Problem -- On Finding Graph Clusterings with Maximum Modularity -- On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs -- A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs -- Approximation Algorithms for Geometric Intersection Graphs -- An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem -- Mixing 3-Colourings in Bipartite Graphs -- Minimum-Weight Cycle Covers and Their Approximability -- On the Number of ?-Orientations -- Complexity and Approximation Results for the Connected Vertex Cover Problem -- Segmenting Strings Homogeneously Via Trees -- Characterisations and Linear-Time Recognition of Probe Cographs -- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete -- Proper Helly Circular-Arc Graphs -- Pathwidth of Circular-Arc Graphs -- Characterization and Recognition of Digraphs of Bounded Kelly-width -- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms -- Obtaining a Planar Graph by Vertex Deletion -- Mixed Search Number and Linear-Width of Interval and Split Graphs -- Lower Bounds for Three Algorithms for theTransversal Hypergraph Generation -- The Complexity of Bottleneck Labeled Graph Problems.
520 _aThe 33rd International Conference "Workshop on Graph-Theoretic Concepts in Computer Science" (WG 2007) took place in the Conference Center in old castleinDornburgnearJena,Germany,June21-23,2007.Theapproximately80 participants came from various countries all over the world, among them Brazil, Canada, the Czech Republic, France, UK, Greece, Hungary, Italy, Japan, The Netherlands, Norway, Sweden, Taiwan, and the USA. WG 2007 continued the series of 32 previous WG conferences. Since 1975, the WG conference has taken place 20 times in Germany, four times in The Netherlands, twice in Austria as well as once in Italy, Slovakia, Switzerland, the Czech Republic, France and in Norway. The WG conference traditionally aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from applications. The goal is to present recent researchresults and to identify and exploredirections of future research. Thecontinuinginterestinthe WGconferenceswasre?ectedin thehighn- ber of submissions; 99 papers were submitted and in an evaluation process with four reports per submission, 30 papers were accepted by the Program Comm- tee for the conference. Due to the high number of submissions and the limited schedule of 3 days, various good papers could not be accepted. There were invited talks by Ming-Yang Kao (Evanston, Illinois) on algori- mic DNA assembly, and by Klaus Jansen (Kiel, Germany) on approximation algorithms for geometric intersection graphs.
650 0 _aComputer science.
_99832
650 0 _aComputer simulation.
_95106
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aNumerical analysis.
_94603
650 0 _aArtificial intelligence
_xData processing.
_921787
650 1 4 _aTheory of Computation.
_9142622
650 2 4 _aComputer Modelling.
_9142623
650 2 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aNumerical Analysis.
_94603
650 2 4 _aData Science.
_934092
700 1 _aBrandstädt, Andreas.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9142624
700 1 _aKratsch, Dieter.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9142625
700 1 _aMüller, Haiko.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9142626
710 2 _aSpringerLink (Online service)
_9142627
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540748380
776 0 8 _iPrinted edition:
_z9783540843672
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4769
_9142628
856 4 0 _uhttps://doi.org/10.1007/978-3-540-74839-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c93271
_d93271