國立虎尾科技大學 |

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

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Graph-Theoretic Concepts in Computer Science/ edited by Andreas Brandstädt, Ekkehard Köhler, Klaus Meer.
其他題名:	44th International Workshop, WG 2018, Cottbus, Germany, June 27–29, 2018, Proceedings /
其他作者:	Brandstädt, Andreas.
面頁冊數:	XIII, 384 p. 102 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Computer science—Mathematics. -
電子資源:	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] :edited by Andreas Brandstädt, Ekkehard Köhler, Klaus Meer. - 1st ed. 2018. - XIII, 384 p. 102 illus.online resource. - Theoretical Computer Science and General Issues ;11159. - Theoretical Computer Science and General Issues ;9163.

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:

1253519
Computer science—Mathematics.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Graph-Theoretic Concepts in Computer Science = 44th International Workshop, WG 2018, Cottbus, Germany, June 27–29, 2018, Proceedings /
LDR:03623nam a22004215i 4500 001 986804
003 DE-He213
005 20200705233451.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783030002565 $9 978-3-030-00256-5
024 7 $a 10.1007/978-3-030-00256-5 $2 doi
035 $a 978-3-030-00256-5
050 4 $a QA76.9.M35
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
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 Brandstädt, Ekkehard Köhler, Klaus Meer.
250 $a 1st ed. 2018.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a XIII, 384 p. 102 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 11159
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 Computer science—Mathematics. $3 1253519
650 0 $a Algorithms. $3 527865
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Arithmetic and logic units, Computer. $3 1255170
650 0 $a Computer graphics. $3 561602
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 Brandstädt, Andreas. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1279335
700 1 $a Köhler, Ekkehard. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1279336
700 1 $a Meer, Klaus. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 895386
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030002558
776 0 8 $i Printed edition: $z 9783030002572
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-00256-5
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)