Graph-theoretic concepts in computer science : 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings /: 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings. (2018)

• Record Type: Book
• Other Titles: WG 2018
• Further Information: Note: Andreas Brandstädt, Ekkehard Köhler, Klaus Meer (eds.).
• Editors: Brandstädt, Andreas; Köhler, Ekkehard; Meer, Klaus
• Other Names: International Workshop WG, 44th
• 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.
• Publisher Details: Cham, Switzerland : Springer
• Publication Date: 2018
• Extent: 1 online resource (xiii, 384 pages), illustrations
• Subjects: 004.01/51; Computer science; Graph theory -- Data processing -- Congresses; Computer science -- Mathematics -- Congresses; Computers -- Programming -- Algorithms; Computers -- Data Modeling & Design; Computers -- Logic Design; Computers -- Computer Graphics; Algorithms & data structures; Graphics programming; Computational complexity; Computer software; Data structures (Computer science); Computer graphics; Computers -- Data Processing; Discrete mathematics; Electronic books
• Languages: English
• ISBNs: 9783030002565
• Related ISBNs: 303000256X; 9783030002558
• Notes: Note: Online resource; title from PDF title page (SpringerLink, viewed September 7, 2018).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.