1 option
Graph-Theoretic Concepts in Computer Science : 46th International Workshop, WG 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers / edited by Isolde Adler, Haiko Müller.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 12301
- Theoretical Computer Science and General Issues, 2512-2029 ; 12301
- Language:
- English
- Subjects (All):
- Computer science-Mathematics.
- Discrete mathematics.
- Algorithms.
- Artificial intelligence-Data processing.
- Mathematics-Data processing.
- Discrete Mathematics in Computer Science.
- Data Science.
- Symbolic and Algebraic Manipulation.
- Computational Mathematics and Numerical Analysis.
- Local Subjects:
- Discrete Mathematics in Computer Science.
- Algorithms.
- Data Science.
- Symbolic and Algebraic Manipulation.
- Computational Mathematics and Numerical Analysis.
- Physical Description:
- 1 online resource (XV, 416 pages) : 50 illustrations
- Edition:
- 1st ed. 2020.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2020.
- System Details:
- text file PDF
- Summary:
- 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. 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-60440-0
- 9783030604400
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.