Parameterized Complexity of Streaming Diameter and Connectivity Problems

被引：0
|
作者：
Oostveen, Jelle J. [1 ]
van Leeuwen, Erik Jan [1 ]
机构：
[1] Department of Information and Computing Sciences, Utrecht University, Netherlands
来源：
Leibniz International Proceedings in Informatics, LIPIcs | 2022年 / 249卷
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Parameter estimation
引用
收藏
相关论文
共 50 条
  • [41] Incremental Problems in the Parameterized Complexity Setting
    Bernard Mans
    Luke Mathieson
    Theory of Computing Systems, 2017, 60 : 3 - 19
  • [42] Parameterized Complexity of Edge Interdiction Problems
    Guo, Jiong
    Shrestha, Yash Raj
    COMPUTING AND COMBINATORICS, COCOON 2014, 2014, 8591 : 166 - 178
  • [43] Parameterized Complexity of Min-Power Asymmetric Connectivity
    Bentert, Matthias
    Haag, Roman
    Hofer, Christian
    Koana, Tomohiro
    Nichterlein, Andre
    COMBINATORIAL ALGORITHMS, IWOCA 2019, 2019, 11638 : 85 - 96
  • [44] Parameterized Complexity of Min-Power Asymmetric Connectivity
    Bentert, Matthias
    Haag, Roman
    Hofer, Christian
    Koana, Tomohiro
    Nichterlein, Andre
    THEORY OF COMPUTING SYSTEMS, 2020, 64 (07) : 1158 - 1182
  • [45] Parameterized Complexity of Min-Power Asymmetric Connectivity
    Matthias Bentert
    Roman Haag
    Christian Hofer
    Tomohiro Koana
    André Nichterlein
    Theory of Computing Systems, 2020, 64 : 1158 - 1182
  • [46] The role of planarity in connectivity problems parameterized by treewidth
    Baste, Julien
    Sau, Ignasi
    THEORETICAL COMPUTER SCIENCE, 2015, 570 : 1 - 14
  • [47] The Role of Planarity in Connectivity Problems Parameterized by Treewidth
    Baste, Julien
    Sau, Ignasi
    PARAMETERIZED AND EXACT COMPUTATION, IPEC 2014, 2014, 8894 : 63 - 74
  • [48] Parameterized computational complexity of finding small-diameter subgraphs
    Schaefer, Alexander
    Komusiewicz, Christian
    Moser, Hannes
    Niedermeier, Rolf
    OPTIMIZATION LETTERS, 2012, 6 (05) : 883 - 891
  • [49] Parameterized computational complexity of finding small-diameter subgraphs
    Alexander Schäfer
    Christian Komusiewicz
    Hannes Moser
    Rolf Niedermeier
    Optimization Letters, 2012, 6 : 883 - 891
  • [50] On the complexity of some colorful problems parameterized by treewidth
    Fellows, Michael R.
    Fomin, Fedor V.
    Lokshtanov, Daniel
    Rosamond, Frances
    Saurabh, Saket
    Szeider, Stefan
    Thomassen, Carsten
    INFORMATION AND COMPUTATION, 2011, 209 (02) : 143 - 153
12345