000 04794nam a22006375i 4500
001 978-3-030-60440-0
003 DE-He213
005 20240423125330.0
007 cr nn 008mamaa
008 201015s2020 sz | s |||| 0|eng d
020 _a9783030604400
_9978-3-030-60440-0
024 7 _a10.1007/978-3-030-60440-0
_2doi
050 4 _aQA76.9.M35
050 4 _aQA297.4
072 7 _aUYAM
_2bicssc
072 7 _aPBD
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
072 7 _aPBD
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aGraph-Theoretic Concepts in Computer Science
_h[electronic resource] :
_b46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers /
_cedited by Isolde Adler, Haiko Müller.
250 _a1st ed. 2020.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2020.
300 _aXV, 416 p. 50 illus.
_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 ;
_v12301
505 0 _aCombinatorial Bounds for Conflict-free Coloring on Open Neighborhoods -- Guarding Quadrangulations and Stacked Triangulations with Edges -- Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space -- Parameterized Inapproximability of Independent Set in H-Free Graphs -- Clique-Width of Point Configurations -- On the complexity of finding large odd induced subgraphs and odd colorings -- Knot Diagrams of Treewidth Two -- Treewidth versus clique number in graph classes with a forbidden structure -- Graph Isomorphism Restricted by Lists -- Clique-Width: Harnessing the Power of Atoms -- Edge elimination and weighted graph classes -- Well-partitioned chordal graphs: obstruction set and disjoint paths -- Plattenbauten: Touching Rectangles in Space Universal Geometric Graphs -- Computing Subset Transversals in H-Free Graphs -- Feedback Edge Sets in Temporal Graphs -- On flips in planar matchings -- Degree Distribution for Duplication-Divergence Graphs: Large Deviations -- On Finding Balanced Bicliques via Matchings -- Finding large matchings in 1-planar graphs of minimum degree 3 -- Strong cliques in diamond-free graphs -- Recognizing k-Clique Extendible Orderings -- Linear-Time Recognition of Double-Threshold Graphs -- Characterization and Linear-time Recognition of Paired Threshold Graphs -- Drawing Graphs as Spanners -- Inserting one edge into a simple drawing is hard -- Bitonic st-orderings for Upward Planar Graphs: The Variable Embedding Setting -- 2.5-Connectivity: Unique Components, Critical Graphs, and Applications Stable Structure on Safe Set Problems in Vertex-weighted Graphs II – Recognition and Complexity -- The linear arboricity conjecture for 3-degenerate graphs -- Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width -- Weighted Additive Spanners.
520 _aThis book constitutes the revised papers of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2020, held in Leeds, UK, in June 2020. The workshop was held virtually due to the COVID-19 pandemic. The 32 full papers presented in this volume were carefully reviewed and selected from 94 submissions. They cover a wide range of areas, aiming to present emerging research results and to identify and explore directions of future research of concepts on graph theory and how they can be applied to various areas in computer science.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aAlgorithms.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aMathematics
_xData processing.
650 1 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aAlgorithms.
650 2 4 _aData Science.
650 2 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aComputational Mathematics and Numerical Analysis.
700 1 _aAdler, Isolde.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMüller, Haiko.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030604394
776 0 8 _iPrinted edition:
_z9783030604417
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12301
856 4 0 _uhttps://doi.org/10.1007/978-3-030-60440-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c176792
_d176792