1 option
Graph-Theoretic Concepts in Computer Science : 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings / edited by Andreas Brandstädt, Ekkehard Köhler, Klaus Meer.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 11159
- Theoretical Computer Science and General Issues, 2512-2029 ; 11159
- Language:
- English
- Subjects (All):
- Computer science-Mathematics.
- Discrete mathematics.
- Algorithms.
- Artificial intelligence-Data processing.
- Computer arithmetic and logic units.
- Computer graphics.
- Discrete Mathematics in Computer Science.
- Data Science.
- Arithmetic and Logic Structures.
- Computer Graphics.
- Local Subjects:
- Discrete Mathematics in Computer Science.
- Algorithms.
- Data Science.
- Arithmetic and Logic Structures.
- Computer Graphics.
- Physical Description:
- 1 online resource (XIII, 384 pages) : 102 illustrations
- Edition:
- 1st ed. 2018.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2018.
- System Details:
- text file PDF
- Summary:
- This book constitutes the revised selected papers of the 44th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2018, held in Cottbus, Germany, in June 2018. The 30 full papers presented in this volume were carefully reviewed and selected from 66 submissions. They cover a wide range of areas, aiming at connecting theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. Another focus is on presenting recent results and on identifying and exploring promising directions of future research.
- Contents:
- On Dispersable Book Embeddings
- Characterising AT-free Graphs with BFS
- Edge Partitions of Optimal 2-plane and 3-plane Graphs
- On Minimum Connecting Transition Sets in Graphs
- Recognizing Hyperelliptic Graphs in Polynomial Time
- On Directed Feedback Vertex Set Parameterized by Treewidth
- Optimality Program in Segment and String Graphs
- Anagram-Free Chromatic Number is Not Pathwidth-Bounded
- Tight Lower Bounds for the Number of st-Cuts
- Sub-exponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity
- Computing Small Pivot-Minors
- Saving Probe Bits by Cube Domination
- Graph Amalgamation under Logical Constraints
- Optimal General Matchings
- Quasimonotone Graphs
- Equiangular Polygon Contact Representations
- Temporal Graph Classes: A View Through Temporal Separators
- Covering A Graph with Nontrivial Vertex-disjoint Paths: Existence and Optimization
- On the Relation of Strong Triadic Closure and Cluster Deletion
- On Perfect Linegraph Squares
- On Weak Isomorphism of Rooted Vertex-Colored Graphs
- Connected Vertex Cover for (sP_1+P_5)-Free Graphs
- Structurally Parameterized d-Scattered Set
- Popular Matchings of Desired Size
- Convexity-Increasing Morphs of Planar Graphs
- Treedepth Bounds in Linear Colorings
- An Improved FPT lgorithm for Independent Feedback Vertex Set
- Construction and Local Routing for Angle-Monotone Graphs
- Characterization and Recognition of Tree 3-Spanner dmissible Directed Path Graphs of Diameter Three. .
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-00256-5
- 9783030002565
- 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.