Local Graph Exploration and Fast Property Testing

被引：0
|
作者：
Czumaj, Artur [1 ]
机构：
[1] Univ Warwick, Ctr Discrete Math & Its Applicat DIMAP, Coventry CV4 7AL, W Midlands, England
来源：
ALGORITHMS-ESA 2010 | 2010年 / 6346卷
基金：
英国工程与自然科学研究理事会;
关键词：
TIME APPROXIMATION ALGORITHMS; MINIMUM SPANNING TREE; BOUNDED-DEGREE GRAPHS; SUBLINEAR-TIME; WEIGHT; BIPARTITENESS; TESTER;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We will present some recent results about testing graph properties in sparse graphs and will discuss graph exploration techniques which allow very efficient algorithms for testing graph properties.
引用
收藏
页码：410 / 414
页数：5
相关论文
共 50 条
  • [1] QUANTUM FAST-FORWARDING: MARKOV CHAINS AND GRAPH PROPERTY TESTING
    Apers, Simon
    Sarlette, Alain
    QUANTUM INFORMATION & COMPUTATION, 2019, 19 (3-4) : 181 - 213
  • [2] Quantum fast-forwarding: Markov chains and graph property testing
    Apers, Simon
    Sarlette, Alain
    Quantum Information and Computation, 2019, 19 (3-4): : 181 - 213
  • [3] Fast Collaborative Graph Exploration
    Dereniowski, Dariusz
    Disser, Yann
    Kosowski, Adrian
    Pajak, Dominik
    Uznanski, Przemyslaw
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II, 2013, 7966 : 520 - 532
  • [4] Fast collaborative graph exploration
    Dereniowski, Dariusz
    Disser, Yann
    Kosowski, Adrian
    Pajak, Dominik
    Uznanski, Przemyslaw
    INFORMATION AND COMPUTATION, 2015, 243 : 37 - 49
  • [5] Fast Graph Exploration by a Mobile Robot
    Kshemkalyani, Ajay D.
    Ali, Faizan
    2018 IEEE FIRST INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND KNOWLEDGE ENGINEERING (AIKE), 2018, : 115 - 118
  • [6] DISCOPG: Property Graph Schema Discovery and Exploration
    Bonifati, Angela
    Dumbrava, Stefania
    Martinez, Emile
    Ghasemi, Fatemeh
    Jaffre, Malo
    Luton, Pacome
    Pickles, Thomas
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2022, 15 (12): : 3654 - 3657
  • [7] Setting port numbers for fast graph exploration
    Ilcinkas, David
    THEORETICAL COMPUTER SCIENCE, 2008, 401 (1-3) : 236 - 242
  • [8] Fast periodic graph exploration with constant memory
    Gasieniec, Leszek
    Klasing, Ralf
    Martin, Russell
    Navarra, Alfredo
    Zhangi, Xiaohui
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS, 2007, 4474 : 26 - +
  • [9] Fast periodic graph exploration with constant memory
    Gasieniec, Leszek
    Klasing, Ralf
    Martin, Russell
    Navarra, Alfredo
    Zhang, Xiaohui
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2008, 74 (05) : 808 - 822
  • [10] Setting port numbers for fast graph exploration
    Ilcinkas, David
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS, 2006, 4056 : 59 - 69
12345