國立高雄大學圖資館 |

Language: English

Back

Graph-theoretic concepts in computer...

(1998 :)

Graph-theoretic concepts in computer science42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016 : revised selected papers /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Graph-theoretic concepts in computer scienceedited by Pinar Heggernes.
Reminder of title:	42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016 : revised selected papers /
remainder title:	WG 2016
other author:	Heggernes, Pinar.
corporate name:
Published:	Berlin, Heidelberg :Springer Berlin Heidelberg :2016.
Description:	x, 307 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Graph theoryCongresses.Data processing
Online resource:	http://dx.doi.org/10.1007/978-3-662-53536-3
ISBN:	9783662535363$q(electronic bk.)

Graph-theoretic concepts in computer science42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016 : revised selected papers /
Graph-theoretic concepts in computer science42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016 : revised selected papers /[electronic resource] :WG 2016edited by Pinar Heggernes. - Berlin, Heidelberg :Springer Berlin Heidelberg :2016. - x, 307 p. :ill., digital ;24 cm. - Lecture notes in computer science,99410302-9743 ;. - Lecture notes in computer science ;4891..

Sequences of radius "k" for complete bipartite graphs -- Approximate Association via Dissociation -- Geodetic convexity parameters for graphs with few short induced paths -- Weighted Ecient Domination for P5-Free and for P6-Free Graphs -- Saving colors and Max Coloring: some xed-parameter tractability results -- Finding Two Edge-Disjoint Paths with Length Constraints -- Packing and covering immersion models of planar subcubic graphs -- The maximum weight stable set problem in (P 6, bull)-free graphs -- Parameterized Power Vertex Cover -- Exhaustive generation of k-critical H-free graphs -- Induced separation dimension -- Tight Bounds for Gomory-Hu-like Cut Counting -- Eccentricity Approximating Trees: Extended Abstract -- Drawing Planar Graphs with Prescribed Face Areas -- Vertex Cover Structural Parameterization Revisited -- Distance-d Independent Set and other problems in graphs with "few" minimal separators -- Parameterized complexity of the MINCCA problem on graphs of bounded decomposability -- On edge intersection graphs of paths with 2 bends -- Almost Induced Matching: Linear Kernels and Parameterized Algorithms -- Parameterized vertex deletion problems for hereditary graph classes with a block property -- Harmonious Coloring: Parameterized Algorithms and Upper bounds -- On Directed Steiner Trees with Multiple Roots -- A Faster Parameterized Algorithm for Group Feedback Edge Set -- Sequence Hypergraphs -- On subgraphs of bounded degeneracy in hypergraphs.

This book constitutes revised selected papers from the 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2016, held in Istanbul, Turkey, in June 2016. The 25 papers presented in this volume were carefully reviewed and selected from 74 submissions.The WG conferences aim to connect theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas of computer science and by extracting new graph problems from applications. Their goal is to present new research results and to identify and explore directions of future research.

ISBN: 9783662535363$q(electronic bk.)

Standard No.: 10.1007/978-3-662-53536-3doiSubjects--Topical Terms:

444844
Graph theory
--Data processing--Congresses.

LC Class. No.: QA166

Dewey Class. No.: 003.72

Graph-theoretic concepts in computer science42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016 : revised selected papers /
LDR:03264nmm a2200361 a 4500 001 497407
003 DE-He213
005 20160927183918.0
006 m d
007 cr nn 008maaau
008 170420s2016 gw s 0 eng d
020 $a 9783662535363$q(electronic bk.)
020 $a 9783662535356$q(paper)
024 7 $a 10.1007/978-3-662-53536-3 $2 doi
035 $a 978-3-662-53536-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166
072 7 $a PBD $2 bicssc
072 7 $a UYAM $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a MAT008000 $2 bisacsh
082 0 4 $a 003.72 $2 23
090 $a QA166 $b .I61 2016
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 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016 : revised selected papers / $c edited by Pinar Heggernes.
246 3 $a WG 2016
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2016.
300 $a x, 307 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 9941
505 0 $a Sequences of radius "k" for complete bipartite graphs -- Approximate Association via Dissociation -- Geodetic convexity parameters for graphs with few short induced paths -- Weighted Ecient Domination for P5-Free and for P6-Free Graphs -- Saving colors and Max Coloring: some xed-parameter tractability results -- Finding Two Edge-Disjoint Paths with Length Constraints -- Packing and covering immersion models of planar subcubic graphs -- The maximum weight stable set problem in (P 6, bull)-free graphs -- Parameterized Power Vertex Cover -- Exhaustive generation of k-critical H-free graphs -- Induced separation dimension -- Tight Bounds for Gomory-Hu-like Cut Counting -- Eccentricity Approximating Trees: Extended Abstract -- Drawing Planar Graphs with Prescribed Face Areas -- Vertex Cover Structural Parameterization Revisited -- Distance-d Independent Set and other problems in graphs with "few" minimal separators -- Parameterized complexity of the MINCCA problem on graphs of bounded decomposability -- On edge intersection graphs of paths with 2 bends -- Almost Induced Matching: Linear Kernels and Parameterized Algorithms -- Parameterized vertex deletion problems for hereditary graph classes with a block property -- Harmonious Coloring: Parameterized Algorithms and Upper bounds -- On Directed Steiner Trees with Multiple Roots -- A Faster Parameterized Algorithm for Group Feedback Edge Set -- Sequence Hypergraphs -- On subgraphs of bounded degeneracy in hypergraphs.
520 $a This book constitutes revised selected papers from the 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2016, held in Istanbul, Turkey, in June 2016. The 25 papers presented in this volume were carefully reviewed and selected from 74 submissions.The WG conferences aim to connect theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas of computer science and by extracting new graph problems from applications. Their goal is to present new research results and to identify and explore directions of future research.
650 0 $a Graph theory $x Data processing $v Congresses. $3 444844
650 0 $a Computer science $3 252805
650 1 4 $a Computer Science. $3 212513
650 2 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 Computer Graphics. $3 274515
650 2 4 $a Geometry. $3 183883
650 2 4 $a Algorithms. $3 184661
700 1 $a Heggernes, Pinar. $3 703726
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
856 4 0 $u http://dx.doi.org/10.1007/978-3-662-53536-3
950 $a Computer Science (Springer-11645)