Atnaujinkite slapukų nuostatas

Graph-Theoretic Concepts in Computer Science: 44th International Workshop, WG 2018, Cottbus, Germany, June 2729, 2018, Proceedings 2018 ed. [Minkštas viršelis]

Edited by , Edited by , Edited by
  • Formatas: Paperback / softback, 384 pages, aukštis x plotis: 235x155 mm, weight: 611 g, 102 Illustrations, black and white; XIII, 384 p. 102 illus., 1 Paperback / softback
  • Serija: Lecture Notes in Computer Science 11159
  • Išleidimo metai: 03-Sep-2018
  • Leidėjas: Springer Nature Switzerland AG
  • ISBN-10: 3030002551
  • ISBN-13: 9783030002558
Kitos knygos pagal šią temą:
Graph-Theoretic Concepts in Computer Science: 44th International Workshop, WG 2018, Cottbus, Germany, June 2729, 2018, Proceedings 2018 ed.Didesnis paveikslėlis
  • Formatas: Paperback / softback, 384 pages, aukštis x plotis: 235x155 mm, weight: 611 g, 102 Illustrations, black and white; XIII, 384 p. 102 illus., 1 Paperback / softback
  • Serija: Lecture Notes in Computer Science 11159
  • Išleidimo metai: 03-Sep-2018
  • Leidėjas: Springer Nature Switzerland AG
  • ISBN-10: 3030002551
  • ISBN-13: 9783030002558
Kitos knygos pagal šią temą:
Pastovi nuoroda: https://www.kriso.lt/db/9783030002558.html
Raktažodžiai:
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.
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.