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
館藏地:  出版年:  卷號: 
館藏
  • 1 筆 • 頁數 1 •
 
W9413608 電子資源 11.線上閱覽_V 電子書 EB QA353.K47 T74 2020 一般使用(Normal) 在架 0
  • 1 筆 • 頁數 1 •
多媒體
評論
Export
取書館
 
 
變更密碼
登入