國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Graph-theoretic concepts in computer...

(1998 :)

Graph-theoretic concepts in computer science44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Graph-theoretic concepts in computer scienceedited by Andreas Brandstadt, Ekkehard Kohler, Klaus Meer.
其他題名:	44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018 : proceedings /
其他題名:	WG 2018
其他作者:	Brandstadt, Andreas.
團體作者:
出版者:	Cham :Springer International Publishing :2018.
面頁冊數:	xiii, 384 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Graph theoryCongresses.Data processing
電子資源:	https://doi.org/10.1007/978-3-030-00256-5
ISBN:	9783030002565$q(electronic bk.)

Graph-theoretic concepts in computer science44th 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 ;4891..

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$q(electronic bk.)

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

444844
Graph theory
--Data processing--Congresses.

LC Class. No.: QA166

Dewey Class. No.: 004.0151

Graph-theoretic concepts in computer science44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018 : proceedings /
LDR:03345nmm a2200373 a 4500 001 543749
003 DE-He213
005 20180903021037.0
006 m d
007 cr nn 008maaau
008 190430s2018 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 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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 : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
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 444844
650 0 $a Computer science $x Mathematics $3 253427
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 Arithmetic and Logic Structures. $3 276274
650 2 4 $a Computer Graphics. $3 274515
700 1 $a Brandstadt, Andreas. $3 468614
700 1 $a Kohler, Ekkehard. $3 822023
700 1 $a Meer, Klaus. $3 347633
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
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-00256-5
950 $a Computer Science (Springer-11645)