國立虎尾科技大學 |

Graph-theoretic concepts in computer science = 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018 : proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Graph-theoretic concepts in computer science/ edited by Andreas Brandstadt, Ekkehard Kohler, Klaus Meer.
Reminder of title:	44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018 : proceedings /
remainder title:	WG 2018
other author:	Brandstadt, Andreas.
corporate name:	Workshop on the Preservation of Stability under Discretization
Published:	Cham :Springer International Publishing : : 2018.,
Description:	xiii, 384 p. :ill., digital ; : 24 cm.;
Contained By:	Springer eBooks
Subject:	Graph theory - Congresses. - Data processing -
Online resource:	https://doi.org/10.1007/978-3-030-00256-5
ISBN:	9783030002565

Graph-theoretic concepts in computer science = 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018 : proceedings /
Graph-theoretic concepts in computer science44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018 : proceedings /[electronic resource] :WG 2018edited by Andreas Brandstadt, Ekkehard Kohler, Klaus Meer. - Cham :Springer International Publishing :2018. - xiii, 384 p. :ill., digital ;24 cm. - Lecture notes in computer science,111590302-9743 ;. - Lecture notes in computer science ;6140..

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.

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.

ISBN: 9783030002565

Standard No.: 10.1007/978-3-030-00256-5doiSubjects--Topical Terms:

784609
Graph theory
--Data processing--Congresses.

LC Class. No.: QA166

Dewey Class. No.: 004.0151

Graph-theoretic concepts in computer science = 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018 : proceedings /
LDR:03345nam a2200373 a 4500 001 928401
003 DE-He213
005 20180903021037.0
006 m d
007 cr nn 008maaau
008 190626s2018 gw s 0 eng d
020 $a 9783030002565 $q (electronic bk.)
020 $a 9783030002558 $q (paper)
024 7 $a 10.1007/978-3-030-00256-5 $2 doi
035 $a 978-3-030-00256-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166
072 7 $a PBD $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a PBD $2 thema
072 7 $a UYAM $2 thema
082 0 4 $a 004.0151 $2 23
090 $a QA166 $b .I61 2018
111 2 $a Workshop on the Preservation of Stability under Discretization $d (2001 : $c Fort Collins, Colo.) $3 527686
245 1 0 $a Graph-theoretic concepts in computer science $h [electronic resource] : $b 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018 : proceedings / $c edited by Andreas Brandstadt, Ekkehard Kohler, Klaus Meer.
246 3 $a WG 2018
260 $a Cham : $c 2018. $b Springer International Publishing : $b Imprint: Springer,
300 $a xiii, 384 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11159
490 1 $a Theoretical computer science and general issues
505 0 $a 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.
520 $a 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.
650 0 $a Graph theory $x Data processing $v Congresses. $3 784609
650 0 $a Computer science $x Mathematics $v Congresses. $3 528619
650 1 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Arithmetic and Logic Structures. $3 672631
650 2 4 $a Computer Graphics. $3 669895
700 1 $a Brandstadt, Andreas. $3 1079157
700 1 $a Kohler, Ekkehard. $3 1208312
700 1 $a Meer, Klaus. $3 895386
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 6140. $3 744199
830 0 $a Theoretical computer science and general issues. $3 1208307
856 4 0 $u https://doi.org/10.1007/978-3-030-00256-5
950 $a Computer Science (Springer-11645)