國立虎尾科技大學 |

Graph-Theoretic Concepts in Computer Science = 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Graph-Theoretic Concepts in Computer Science/ edited by Łukasz Kowalik, Michał Pilipczuk, Paweł Rzążewski.
其他題名:	47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers /
其他作者:	Rzążewski, Paweł.
面頁冊數:	XIII, 404 p. 72 illus., 35 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Discrete Mathematics in Computer Science. -
電子資源:	https://doi.org/10.1007/978-3-030-86838-3
ISBN:	9783030868383

Graph-Theoretic Concepts in Computer Science = 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers /
Graph-Theoretic Concepts in Computer Science47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers /[electronic resource] :edited by Łukasz Kowalik, Michał Pilipczuk, Paweł Rzążewski. - 1st ed. 2021. - XIII, 404 p. 72 illus., 35 illus. in color.online resource. - Theoretical Computer Science and General Issues ;12911. - Theoretical Computer Science and General Issues ;9163.

Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set -- Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation -- Block Elimination Distance -- On Fair Covering and Hitting Problems -- On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem -- FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More -- Disjoint Stable Matchings in Linear Time -- Complementation in T-perfect Graphs -- On subgraph complementation to H-free graphs -- Odd Cycle Transversal in Mixed Graphs -- Preventing Small $(s, t)$-Cuts by Protecting Edges -- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel -- A heuristic approach to the treedepth decomposition problem for large graphs -- The Perfect Matching Cut Problem Revisited -- The Complexity of Gerrymandering Over Graphs: Paths and Trees -- Feedback Vertex Set on Hamiltonian Graphs -- Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality -- The Dynamic Complexity of Acyclic Hypergraph Homomorphisms -- Linearizable special cases of the quadratic shortest path problem -- A Linear-time Parameterized Algorithm for Computing the Width of a DAG -- On Morphing 1-Planar Drawings -- Bears with Hats and Independence Polynomials -- The Largest Connected Subgraph Game -- Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries -- Beyond Helly graphs: the diameter problem on absolute retracts -- Acyclic, Star, and Injective Colouring: Bounding the Diameter -- The Graphs of Stably Matchable Pairs -- On additive spanners in weighted graphs with local error -- Labeling Schemes for Deterministic Radio Multi-Broadcast -- On 3-Coloring of (2P_4, C_5)-Free Graphs.

This book constitutes the proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science which was held during June 23–25, 2021. The conference was planned to take place in Warsaw, Poland, but changed to an online event due to the COVID-19 pandemic. The 30 full papers included in this volume were carefully reviewed and selected from 73 submissions. The conference aims to merge theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science or by extracting new graph-theoretic problems from applications.

ISBN: 9783030868383

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

670123
Discrete Mathematics in Computer Science.

LC Class. No.: QA71-90

Dewey Class. No.: 518

Graph-Theoretic Concepts in Computer Science = 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers /
LDR:03892nam a22004095i 4500 001 1051405
003 DE-He213
005 20211202000310.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030868383 $9 978-3-030-86838-3
024 7 $a 10.1007/978-3-030-86838-3 $2 doi
035 $a 978-3-030-86838-3
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 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers / $c edited by Łukasz Kowalik, Michał Pilipczuk, Paweł Rzążewski.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XIII, 404 p. 72 illus., 35 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 12911
505 0 $a Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set -- Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation -- Block Elimination Distance -- On Fair Covering and Hitting Problems -- On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem -- FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More -- Disjoint Stable Matchings in Linear Time -- Complementation in T-perfect Graphs -- On subgraph complementation to H-free graphs -- Odd Cycle Transversal in Mixed Graphs -- Preventing Small $(s, t)$-Cuts by Protecting Edges -- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel -- A heuristic approach to the treedepth decomposition problem for large graphs -- The Perfect Matching Cut Problem Revisited -- The Complexity of Gerrymandering Over Graphs: Paths and Trees -- Feedback Vertex Set on Hamiltonian Graphs -- Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality -- The Dynamic Complexity of Acyclic Hypergraph Homomorphisms -- Linearizable special cases of the quadratic shortest path problem -- A Linear-time Parameterized Algorithm for Computing the Width of a DAG -- On Morphing 1-Planar Drawings -- Bears with Hats and Independence Polynomials -- The Largest Connected Subgraph Game -- Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries -- Beyond Helly graphs: the diameter problem on absolute retracts -- Acyclic, Star, and Injective Colouring: Bounding the Diameter -- The Graphs of Stably Matchable Pairs -- On additive spanners in weighted graphs with local error -- Labeling Schemes for Deterministic Radio Multi-Broadcast -- On 3-Coloring of (2P_4, C_5)-Free Graphs.
520 $a This book constitutes the proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science which was held during June 23–25, 2021. The conference was planned to take place in Warsaw, Poland, but changed to an online event due to the COVID-19 pandemic. The 30 full papers included in this volume were carefully reviewed and selected from 73 submissions. The conference aims to merge theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science or by extracting new graph-theoretic problems from applications.
650 2 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 1 4 $a Computational Mathematics and Numerical Analysis. $3 669338
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 Computer mathematics. $3 1199796
700 1 $a Rzążewski, Paweł. $e editor. $1 https://orcid.org/0000-0001-7696-3848 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1355914
700 1 $a Pilipczuk, Michał. $e author. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1255786
700 1 $a Kowalik, Łukasz. $e author. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1255782
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030868376
776 0 8 $i Printed edition: $z 9783030868390
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-86838-3
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)