Space limited linear-time graph algorithms on big data

被引:2
|
作者
Chen, Jianer [1 ]
Chu, Zirui [2 ]
Guo, Ying [2 ]
Yang, Wei [2 ]
机构
[1] Texas A&M Univ, Dept Comp Sci & Engn, College Stn, TX 77843 USA
[2] Guangzhou Univ, Sch Comp Sci, Guangzhou 510006, Peoples R China
关键词
Big data; Maximal matching; Edge dominating set; Vertex cover; Kernelization algorithm; Streaming algorithm; EDGE DOMINATING SET;
D O I
10.1016/j.tcs.2024.114468
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We study algorithms for graph problems in which the graphs are of extremely large size N so that super -linear time w ( N ) or linear space Theta( N ) would become impractical. We use a parameter k to characterize the computational power of a normal computer that can provide additional time and space bounded by polynomials of k in dealing with the large graphs. In particular, we are interested in strict linear -time algorithms using space O ( k O (1) ). In our case studies, as examples, we present (1) a randomized greedy algorithm of time O ( N ) and space O ( k 2 ) for a parameterized version of the M AXIMAL M ATCHING problem; and (2) randomized kernelization algorithms of time O ( N ) and space O ( k O (1) ) for a number of well-known NP -hard problems. Our kernelization algorithms have their kernel sizes match the best kernel sizes by known polynomialtime kernelization algorithms with no space constraints for the problems. We also study the relationship between our proposed model and the streaming model. This study motivates a new streaming kernelization algorithm for the famous V ERTEX C OVER problem that has an optimal update time complexity while matches the best known space complexity of streaming algorithms for the problem.
引用
收藏
页数:18
相关论文
共 50 条
  • [1] Space Limited Graph Algorithms on Big Data
    Chen, Jianer
    Chu, Zirui
    Guo, Ying
    Yang, Wei
    COMPUTING AND COMBINATORICS, COCOON 2022, 2022, 13595 : 255 - 267
  • [2] Linear-time parameterized algorithms with limited local resources
    Chen, Jianer
    Guo, Ying
    Huang, Qin
    INFORMATION AND COMPUTATION, 2022, 289
  • [3] Linear-Time Limited Automata
    Guillon, Bruno
    Prigioniero, Luca
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2018, 2018, 10952 : 126 - 138
  • [4] Linear-time limited automata
    Guillon, Bruno
    Prigioniero, Luca
    THEORETICAL COMPUTER SCIENCE, 2019, 798 : 95 - 108
  • [5] A Linear-time Graph Kernel
    Hido, Shohei
    Kashima, Hisashi
    2009 9TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, 2009, : 179 - 188
  • [6] Starting with nondeterminism: The systematic derivation of linear-time graph layout algorithms
    Bodlaender, HL
    Fellows, MR
    Thilikos, DM
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS, 2003, 2747 : 239 - 248
  • [7] LINEAR-TIME ALGORITHMS IN MEMORY HIERARCHIES
    REGAN, KW
    INFORMATION PROCESSING '94, VOL I: TECHNOLOGY AND FOUNDATIONS, 1994, 51 : 288 - 293
  • [8] An efficient linear-time clustering algorithms
    Wang, L
    Zang, LJ
    Song, RF
    Proceedings of the 11th Joint International Computer Conference, 2005, : 678 - 681
  • [9] Linear-Time Algorithms for Proportional Apportionment
    Cheng, Zhanpeng
    Eppstein, David
    ALGORITHMS AND COMPUTATION, ISAAC 2014, 2014, 8889 : 581 - 592
  • [10] A Linear-Time Algorithm for the Aggregation and Visualization of Big Spatial Point Data
    Beilschmidt, Christian
    Fober, Thomas
    Mattig, Michael
    Seeger, Bernhard
    25TH ACM SIGSPATIAL INTERNATIONAL CONFERENCE ON ADVANCES IN GEOGRAPHIC INFORMATION SYSTEMS (ACM SIGSPATIAL GIS 2017), 2017,