Del 12301 - Lecture Notes in Computer Science

Graph-Theoretic Concepts in Computer Science

46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers

Häftad, Engelska, 2020

AvIsolde Adler,Haiko Müller,Haiko Muller

699 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This 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.

Produktinformation

Utgivningsdatum2020-10-16
Mått155 x 235 x 24 mm
Vikt651 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor416
FörlagSpringer Nature Switzerland AG
ISBN9783030604394

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT
Beräkning och matematisk analys inom Naturvetenskap och teknik
Diskret matematik inom Naturvetenskap och teknik
Databaser inom Data och IT

Combinatorial 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.