國立虎尾科技大學 |

Graph-Theoretic Concepts in Computer Science = 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Graph-Theoretic Concepts in Computer Science/ edited by Ignasi Sau, Dimitrios M. Thilikos.
其他題名:	45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers /
其他作者:	Sau, Ignasi.
面頁冊數:	XXI, 394 p. 304 illus., 41 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computer mathematics. -
電子資源:	https://doi.org/10.1007/978-3-030-30786-8
ISBN:	9783030307868

Graph-Theoretic Concepts in Computer Science = 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers /
Graph-Theoretic Concepts in Computer Science45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers /[electronic resource] :edited by Ignasi Sau, Dimitrios M. Thilikos. - 1st ed. 2019. - XXI, 394 p. 304 illus., 41 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11789. - Theoretical Computer Science and General Issues ;9163.

Logic and Random Graphs -- Unavoidability and universality of digraphs -- Parameterized algorithms for geometric graphs via decomposition theorems -- Subexponential algorithms for variants of homomorphism problem in string graphs -- The 4-Steiner Root Problem -- Hamiltonicity below Dirac’s condition -- Maximum Independent Sets in Subcubic Graphs: New Results -- Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs -- Local approximation of the Maximum Cut in regular graphs -- Fixed-parameter tractability of counting small minimum (S,T)-cuts -- Fast Breadth-First Search in Still Less Space -- A Turing Kernelization Dichotomy for Structural Parameterizations of F-Minor-Free Deletion -- Flip distances between graph orientations -- Graph functionality -- On Happy Colorings, Cuts, and Structural Parameterizations -- Shortest Reconfiguration of Matchings -- Travelling on Graphs with Small Highway Dimension -- The Power of Cut-Based Parameters for Computing Edge Disjoint Paths -- Geometric Representations of Dichotomous Ordinal Data -- Linear MIM-width of Trees -- Approximating Minimum Dominating Set on String graphs -- Classified Rank-Maximal Matchings and Popular Matchings -- Algorithms and Hardness -- Maximum Matchings and Minimum Blocking Sets in Theta-6 Graphs -- A polynomial-time algorithm for the independent set problem in $\{P_{10},C_4,C_6\}$-free graphs -- Independent Set Reconfiguration Parameterized by Modular-Width -- Counting independent sets in graphs with bounded bipartite pathwidth -- Intersection Graphs of Non-Crossing Paths -- Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs -- Color Refinement, Homomorphisms, and Hypergraphs -- 3-colorable planar graphs have an intersection segment representation using 3 slopes -- The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms -- Minimal separators in graph classes defined by small forbidden induced subgraphs.

This book constitutes the revised papers of the 45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019, held in Vall de Núria, Spain, in June 2019. The 29 full papers presented in this volume were carefully reviewed and selected from 87 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: 9783030307868

Standard No.: 10.1007/978-3-030-30786-8doiSubjects--Topical Terms:

1199796
Computer mathematics.

LC Class. No.: QA71-90

Dewey Class. No.: 518

Graph-Theoretic Concepts in Computer Science = 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers /
LDR:04034nam a22004095i 4500 001 1007450
003 DE-He213
005 20200701025523.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030307868 $9 978-3-030-30786-8
024 7 $a 10.1007/978-3-030-30786-8 $2 doi
035 $a 978-3-030-30786-8
050 4 $a QA71-90
072 7 $a PBKS $2 bicssc
072 7 $a MAT006000 $2 bisacsh
072 7 $a PBKS $2 thema
082 0 4 $a 518 $2 23
245 1 0 $a Graph-Theoretic Concepts in Computer Science $h [electronic resource] : $b 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers / $c edited by Ignasi Sau, Dimitrios M. Thilikos.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XXI, 394 p. 304 illus., 41 illus. in color. $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 11789
505 0 $a Logic and Random Graphs -- Unavoidability and universality of digraphs -- Parameterized algorithms for geometric graphs via decomposition theorems -- Subexponential algorithms for variants of homomorphism problem in string graphs -- The 4-Steiner Root Problem -- Hamiltonicity below Dirac’s condition -- Maximum Independent Sets in Subcubic Graphs: New Results -- Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs -- Local approximation of the Maximum Cut in regular graphs -- Fixed-parameter tractability of counting small minimum (S,T)-cuts -- Fast Breadth-First Search in Still Less Space -- A Turing Kernelization Dichotomy for Structural Parameterizations of F-Minor-Free Deletion -- Flip distances between graph orientations -- Graph functionality -- On Happy Colorings, Cuts, and Structural Parameterizations -- Shortest Reconfiguration of Matchings -- Travelling on Graphs with Small Highway Dimension -- The Power of Cut-Based Parameters for Computing Edge Disjoint Paths -- Geometric Representations of Dichotomous Ordinal Data -- Linear MIM-width of Trees -- Approximating Minimum Dominating Set on String graphs -- Classified Rank-Maximal Matchings and Popular Matchings -- Algorithms and Hardness -- Maximum Matchings and Minimum Blocking Sets in Theta-6 Graphs -- A polynomial-time algorithm for the independent set problem in $\{P_{10},C_4,C_6\}$-free graphs -- Independent Set Reconfiguration Parameterized by Modular-Width -- Counting independent sets in graphs with bounded bipartite pathwidth -- Intersection Graphs of Non-Crossing Paths -- Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs -- Color Refinement, Homomorphisms, and Hypergraphs -- 3-colorable planar graphs have an intersection segment representation using 3 slopes -- The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms -- Minimal separators in graph classes defined by small forbidden induced subgraphs.
520 $a This book constitutes the revised papers of the 45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019, held in Vall de Núria, Spain, in June 2019. The 29 full papers presented in this volume were carefully reviewed and selected from 87 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 mathematics. $3 1199796
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Algorithms. $3 527865
650 0 $a Arithmetic and logic units, Computer. $3 1255170
650 1 4 $a Computational Mathematics and Numerical Analysis. $3 669338
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Arithmetic and Logic Structures. $3 672631
700 1 $a Sau, Ignasi. $e editor. $1 https://orcid.org/0000-0002-8981-9287 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1301211
700 1 $a Thilikos, Dimitrios M. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 883632
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030307851
776 0 8 $i Printed edition: $z 9783030307875
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-30786-8
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)