Description
Graph-Theoretic Concepts in Computer Science, 1st ed. 2016
42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers
Theoretical Computer Science and General Issues Series
Coordinator: Heggernes Pinar
Language: EnglishSubjects for Graph-Theoretic Concepts in Computer Science:
Support: Print on demand
Description
/li>Contents
/li>Comment
/li>
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.
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.
Includes supplementary material: sn.pub/extras