東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Treewidth, kernels, and algorithms =...

Bodlaender, H. L.,

FindBook

Google Book

Amazon

博客來

Treewidth, kernels, and algorithms = essays dedicated to Hans L. Bodlaender on the occasion of his 60th birthday /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Treewidth, kernels, and algorithms/ edited by Fedor V. Fomin, Stefan Kratsch, Erik Jan van Leeuwen.
其他題名:	essays dedicated to Hans L. Bodlaender on the occasion of his 60th birthday /
其他作者:	Bodlaender, H. L.,
出版者:	Cham :Springer International Publishing : : 2020.,
面頁冊數:	lv, 299 p. :ill. (some col.), digital ;24 cm.
內容註:	Seeing Arboretum for the (partial k) Trees -- Collaborating With Hans: Some Remaining Wonderments -- Hans Bodlaender and the Theory of Kernelization Lower Bounds -- Algorithms, Complexity, and Hans -- Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs -- As Time Goes By: Reflections on Treewidth for Temporal Graphs -- Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs -- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds -- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths -- Four shorts stories on surprising algorithmic uses of treewidth -- Algorithms for NP-Hard Problems via Rank-related Parameters of Matrices -- A Survey on Spanning Tree Congestion -- Surprising Applications of Treewidth Bounds for Planar Graphs -- Computing tree decompositions -- Experimental analysis of treewidth -- A Retrospective on (Meta) Kernelization -- Games, Puzzles and Treewidth -- Fast Algorithms for Join Operations on Tree Decompositions.
Contained By:	Springer Nature eBook
標題:	Kernel functions. -
電子資源:	https://doi.org/10.1007/978-3-030-42071-0
ISBN:	9783030420710

Treewidth, kernels, and algorithms = essays dedicated to Hans L. Bodlaender on the occasion of his 60th birthday /
Treewidth, kernels, and algorithmsessays dedicated to Hans L. Bodlaender on the occasion of his 60th birthday /[electronic resource] :edited by Fedor V. Fomin, Stefan Kratsch, Erik Jan van Leeuwen. - Cham :Springer International Publishing :2020. - lv, 299 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,121600302-9743 ;. - Lecture notes in computer science ;12160..

Seeing Arboretum for the (partial k) Trees -- Collaborating With Hans: Some Remaining Wonderments -- Hans Bodlaender and the Theory of Kernelization Lower Bounds -- Algorithms, Complexity, and Hans -- Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs -- As Time Goes By: Reflections on Treewidth for Temporal Graphs -- Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs -- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds -- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths -- Four shorts stories on surprising algorithmic uses of treewidth -- Algorithms for NP-Hard Problems via Rank-related Parameters of Matrices -- A Survey on Spanning Tree Congestion -- Surprising Applications of Treewidth Bounds for Planar Graphs -- Computing tree decompositions -- Experimental analysis of treewidth -- A Retrospective on (Meta) Kernelization -- Games, Puzzles and Treewidth -- Fast Algorithms for Join Operations on Tree Decompositions.

This Festschrift was published in honor of Hans L. Bodlaender on the occasion of his 60th birthday. The 14 full and 5 short contributions included in this volume show the many transformative discoveries made by H.L. Bodlaender in the areas of graph algorithms, parameterized complexity, kernelization and combinatorial games. The papers are written by his former Ph.D. students and colleagues as well as by his former Ph.D. advisor, Jan van Leeuwen.

ISBN: 9783030420710

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

562986
Kernel functions.

LC Class. No.: QA353.K47 / T74 2020

Dewey Class. No.: 515.9

Treewidth, kernels, and algorithms = essays dedicated to Hans L. Bodlaender on the occasion of his 60th birthday /
LDR:02768nmm a2200349 a 4500 001 2257980
003 DE-He213
005 20200703160145.0
006 m d
007 cr nn 008maaau
008 220420s2020 sz s 0 eng d
020 $a 9783030420710 $q (electronic bk.)
020 $a 9783030420703 $q (paper)
024 7 $a 10.1007/978-3-030-42071-0 $2 doi
035 $a 978-3-030-42071-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA353.K47 $b T74 2020
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 515.9 $2 23
090 $a QA353.K47 $b T786 2020
245 0 0 $a Treewidth, kernels, and algorithms $h [electronic resource] : $b essays dedicated to Hans L. Bodlaender on the occasion of his 60th birthday / $c edited by Fedor V. Fomin, Stefan Kratsch, Erik Jan van Leeuwen.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a lv, 299 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12160
490 1 $a Theoretical computer science and general issues
505 0 $a Seeing Arboretum for the (partial k) Trees -- Collaborating With Hans: Some Remaining Wonderments -- Hans Bodlaender and the Theory of Kernelization Lower Bounds -- Algorithms, Complexity, and Hans -- Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs -- As Time Goes By: Reflections on Treewidth for Temporal Graphs -- Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs -- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds -- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths -- Four shorts stories on surprising algorithmic uses of treewidth -- Algorithms for NP-Hard Problems via Rank-related Parameters of Matrices -- A Survey on Spanning Tree Congestion -- Surprising Applications of Treewidth Bounds for Planar Graphs -- Computing tree decompositions -- Experimental analysis of treewidth -- A Retrospective on (Meta) Kernelization -- Games, Puzzles and Treewidth -- Fast Algorithms for Join Operations on Tree Decompositions.
520 $a This Festschrift was published in honor of Hans L. Bodlaender on the occasion of his 60th birthday. The 14 full and 5 short contributions included in this volume show the many transformative discoveries made by H.L. Bodlaender in the areas of graph algorithms, parameterized complexity, kernelization and combinatorial games. The papers are written by his former Ph.D. students and colleagues as well as by his former Ph.D. advisor, Jan van Leeuwen.
650 0 $a Kernel functions. $3 562986
650 0 $a Algorithms. $3 536374
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Computer Graphics. $3 892532
650 2 4 $a Data Structures. $3 891009
650 2 4 $a Mathematics of Computing. $3 891213
650 2 4 $a Information Systems Applications (incl. Internet) $3 1565452
650 2 4 $a Computer Communication Networks. $3 775497
700 1 $a Bodlaender, H. L., $e honouree. $3 3529662
700 1 $a Fomin, Fedor V. $3 1245475
700 1 $a Kratsch, Stefan. $3 3529663
700 1 $a Leeuwen, Erik Jan van. $3 3529664
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 12160. $3 3529665
830 0 $a Theoretical computer science and general issues. $3 3382501
856 4 0 $u https://doi.org/10.1007/978-3-030-42071-0
950 $a Computer Science (SpringerNature-11645)