Graph-Theoretic Concepts in Computer Science 44th International Workshop, WG 2018, Cottbus, Germany, June 27–29, 2018, Proceedings

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.

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

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Brandstädt, Andreas (Editor), Köhler, Ekkehard (Editor), Meer, Klaus (Editor)
Format: eBook
Language:English
Published: Cham : Springer International Publishing : Imprint: Springer, 2018.
Edition:1st ed. 2018.
Series:Theoretical Computer Science and General Issues ; 11159
Springer eBook Collection.
Subjects:
Computer science—Mathematics.
Algorithms.
Data structures (Computer science).
Arithmetic and logic units, Computer.
Computer graphics.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of 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. .

Similar Items