國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Graph-theoretic concepts in computer...

(1998 :)

Graph-theoretic concepts in computer science46th International Workshop, WG 2020, Leeds, UK, June 24-26, 2020 : revised selected papers /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Graph-theoretic concepts in computer scienceedited by Isolde Adler, Haiko Muller.
其他題名:	46th International Workshop, WG 2020, Leeds, UK, June 24-26, 2020 : revised selected papers /
其他題名:	WG 2020
其他作者:	Adler, Isolde.
團體作者:
出版者:	Cham :Springer International Publishing :2020.
面頁冊數:	xv, 416 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Graph theoryCongresses.Data processing
電子資源:	https://doi.org/10.1007/978-3-030-60440-0
ISBN:	9783030604400$q(electronic bk.)

Graph-theoretic concepts in computer science46th International Workshop, WG 2020, Leeds, UK, June 24-26, 2020 : revised selected papers /
Graph-theoretic concepts in computer science46th International Workshop, WG 2020, Leeds, UK, June 24-26, 2020 : revised selected papers /[electronic resource] :WG 2020edited by Isolde Adler, Haiko Muller. - Cham :Springer International Publishing :2020. - xv, 416 p. :ill., digital ;24 cm. - Lecture notes in computer science,123010302-9743 ;. - Lecture notes in computer science ;4891..

Combinatorial Bounds for Conflict-free Coloring on Open Neighborhoods -- Guarding Quadrangulations and Stacked Triangulations with Edges -- Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space -- Parameterized Inapproximability of Independent Set in H-Free Graphs -- Clique-Width of Point Configurations -- On the complexity of finding large odd induced subgraphs and odd colorings -- Knot Diagrams of Treewidth Two -- Treewidth versus clique number in graph classes with a forbidden structure -- Graph Isomorphism Restricted by Lists -- Clique-Width: Harnessing the Power of Atoms -- Edge elimination and weighted graph classes -- Well-partitioned chordal graphs: obstruction set and disjoint paths -- Plattenbauten: Touching Rectangles in Space Universal Geometric Graphs -- Computing Subset Transversals in H-Free Graphs -- Feedback Edge Sets in Temporal Graphs -- On flips in planar matchings -- Degree Distribution for Duplication-Divergence Graphs: Large Deviations -- On Finding Balanced Bicliques via Matchings -- Finding large matchings in 1-planar graphs of minimum degree 3 -- Strong cliques in diamond-free graphs -- Recognizing k-Clique Extendible Orderings -- Linear-Time Recognition of Double-Threshold Graphs -- Characterization and Linear-time Recognition of Paired Threshold Graphs -- Drawing Graphs as Spanners -- Inserting one edge into a simple drawing is hard -- Bitonic st-orderings for Upward Planar Graphs: The Variable Embedding Setting -- 2.5-Connectivity: Unique Components, Critical Graphs, and Applications Stable Structure on Safe Set Problems in Vertex-weighted Graphs II - Recognition and Complexity -- The linear arboricity conjecture for 3-degenerate graphs -- Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width -- Weighted Additive Spanners.

This book constitutes the revised papers of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2020, held in Leeds, UK, in June 2020. The workshop was held virtually due to the COVID-19 pandemic. The 32 full papers presented in this volume were carefully reviewed and selected from 94 submissions. They cover a wide range of areas, aiming to present emerging research results and to identify and explore directions of future research of concepts on graph theory and how they can be applied to various areas in computer science.

ISBN: 9783030604400$q(electronic bk.)

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

444844
Graph theory
--Data processing--Congresses.

LC Class. No.: QA166

Dewey Class. No.: 004.0151

Graph-theoretic concepts in computer science46th International Workshop, WG 2020, Leeds, UK, June 24-26, 2020 : revised selected papers /
LDR:03655nmm a2200373 a 4500 001 588835
003 DE-He213
005 20201015103951.0
006 m d
007 cr nn 008maaau
008 210525s2020 sz s 0 eng d
020 $a 9783030604400$q(electronic bk.)
020 $a 9783030604394$q(paper)
024 7 $a 10.1007/978-3-030-60440-0 $2 doi
035 $a 978-3-030-60440-0
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 2020
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Graph-theoretic concepts in computer science $h [electronic resource] : $b 46th International Workshop, WG 2020, Leeds, UK, June 24-26, 2020 : revised selected papers / $c edited by Isolde Adler, Haiko Muller.
246 3 $a WG 2020
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a xv, 416 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12301
490 1 $a Theoretical computer science and general issues
505 0 $a Combinatorial Bounds for Conflict-free Coloring on Open Neighborhoods -- Guarding Quadrangulations and Stacked Triangulations with Edges -- Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space -- Parameterized Inapproximability of Independent Set in H-Free Graphs -- Clique-Width of Point Configurations -- On the complexity of finding large odd induced subgraphs and odd colorings -- Knot Diagrams of Treewidth Two -- Treewidth versus clique number in graph classes with a forbidden structure -- Graph Isomorphism Restricted by Lists -- Clique-Width: Harnessing the Power of Atoms -- Edge elimination and weighted graph classes -- Well-partitioned chordal graphs: obstruction set and disjoint paths -- Plattenbauten: Touching Rectangles in Space Universal Geometric Graphs -- Computing Subset Transversals in H-Free Graphs -- Feedback Edge Sets in Temporal Graphs -- On flips in planar matchings -- Degree Distribution for Duplication-Divergence Graphs: Large Deviations -- On Finding Balanced Bicliques via Matchings -- Finding large matchings in 1-planar graphs of minimum degree 3 -- Strong cliques in diamond-free graphs -- Recognizing k-Clique Extendible Orderings -- Linear-Time Recognition of Double-Threshold Graphs -- Characterization and Linear-time Recognition of Paired Threshold Graphs -- Drawing Graphs as Spanners -- Inserting one edge into a simple drawing is hard -- Bitonic st-orderings for Upward Planar Graphs: The Variable Embedding Setting -- 2.5-Connectivity: Unique Components, Critical Graphs, and Applications Stable Structure on Safe Set Problems in Vertex-weighted Graphs II - Recognition and Complexity -- The linear arboricity conjecture for 3-degenerate graphs -- Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width -- Weighted Additive Spanners.
520 $a This book constitutes the revised papers of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2020, held in Leeds, UK, in June 2020. The workshop was held virtually due to the COVID-19 pandemic. The 32 full papers presented in this volume were carefully reviewed and selected from 94 submissions. They cover a wide range of areas, aiming to present emerging research results and to identify and explore directions of future research of concepts on graph theory and how they can be applied to various areas in computer science.
650 0 $a Graph theory $x Data processing $v Congresses. $3 444844
650 1 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Data Structures. $3 273992
650 2 4 $a Symbolic and Algebraic Manipulation. $3 273720
650 2 4 $a Computational Mathematics and Numerical Analysis. $3 274020
700 1 $a Adler, Isolde. $3 880371
700 1 $a Muller, Haiko. $3 880372
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Theoretical computer science and general issues. $3 822018
856 4 0 $u https://doi.org/10.1007/978-3-030-60440-0
950 $a Computer Science (SpringerNature-11645)