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
关键词
Compendex;
D O I
暂无
中图分类号
学科分类号
摘要
Parameter estimation
引用
收藏
相关论文
共 50 条
  • [21] Parameterized complexity of happy coloring problems
    Agrawal, Akanksha
    Aravind, N. R.
    Kalyanasundaram, Subrahmanyam
    Kare, Anjeneya Swami
    Lauri, Juho
    Misra, Neeldhara
    Reddy, I. Vinod
    THEORETICAL COMPUTER SCIENCE, 2020, 835 : 58 - 81
  • [22] The parameterized complexity of maximality and minimality problems
    Chen, Yijia
    Flum, Joerg
    PARAMETERIZED AND EXACT COMPUTATION, PROCEEDINGS, 2006, 4169 : 25 - 37
  • [23] PARAMETERIZED COMPLEXITY FOR GRAPH LAYOUT PROBLEMS
    Serna, Maria
    Thilikos, Dimitrios M.
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2005, (86): : 41 - 65
  • [24] Parameterized complexity of constraint satisfaction problems
    Marx, D
    19TH IEEE ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2004, : 139 - 149
  • [25] Incremental Problems in the Parameterized Complexity Setting
    Mans, Bernard
    Mathieson, Luke
    THEORY OF COMPUTING SYSTEMS, 2017, 60 (01) : 3 - 19
  • [26] Parameterized Complexity of Directed Spanner Problems
    Fedor V. Fomin
    Petr A. Golovach
    William Lochet
    Pranabendu Misra
    Saket Saurabh
    Roohani Sharma
    Algorithmica, 2022, 84 : 2292 - 2308
  • [27] Parameterized Complexity of Eulerian Deletion Problems
    Cygan, Marek
    Marx, Daniel
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Schlotter, Ildiko
    ALGORITHMICA, 2014, 68 (01) : 41 - 61
  • [28] On miniaturized problems in parameterized complexity theory
    Chen, YJ
    Flum, J
    PARAMETERIZED AND EXACT COMPUTATION, PROCEEDINGS, 2004, 3162 : 108 - 120
  • [29] Parameterized Complexity of Eulerian Deletion Problems
    Marek Cygan
    Dániel Marx
    Marcin Pilipczuk
    Michał Pilipczuk
    Ildikó Schlotter
    Algorithmica, 2014, 68 : 41 - 61
  • [30] Parameterized complexity of constraint satisfaction problems
    Marx, D
    COMPUTATIONAL COMPLEXITY, 2005, 14 (02) : 153 - 183