Listing All Fixed-Length Simple Cycles in Sparse Graphs in Optimal Time

被引：2
|
作者：
Manoussakis, George [1 ]
机构：
[1] Univ Paris Saclay, Univ Paris Sud, CNRS, LRI, F-91405 Orsay, France
来源：
FUNDAMENTALS OF COMPUTATION THEORY, FCT 2017 | 2017年 / 10472卷
关键词：
Sparse graphs; k-degenerate; Fixed-size cycles listing; PLANAR; ARBORICITY;
D O I：
10.1007/978-3-662-55751-8_28
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The degeneracy of an n-vertex graph G is the smallest number k such that every subgraph of G contains a vertex of degree at most k. We present an algorithm for enumerating all simple cycles of length p in an n-order k-degenerate graph running in time O(n([p/2]) k([p/2])). We then show that this algorithm is worst-case output size optimal by proving a T(n([p/2]) k([p/2])) bound on the maximal number of simple p-length cycles in these graphs. Our results also apply to induced (chordless) cycles.
引用
收藏
页码：355 / 366
页数：12
相关论文
共 47 条
  • [21] On The Outage Performance Of Line-Of-Sight Massive MIMO with a Fixed-Length Uniform Linear Sparse Array
    Farsaei, A.
    Amani, N.
    Alvarado, A.
    Willems, E. M. J.
    Gustavsson, U.
    Maaskant, R.
    PROCEEDINGS OF THE 2019 9TH IEEE-APS TOPICAL CONFERENCE ON ANTENNAS AND PROPAGATION IN WIRELESS COMMUNICATIONS (IEEE APWC' 19), 2019, : 345 - 348
  • [22] On the size of graphs whose cycles have length divisible by a fixed integer
    Akbari, S.
    Jamaali, M.
    Mahmoody, A.
    Fakhari, S. A. Seyed
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2009, 45 : 67 - 72
  • [23] Representation of Dense Volume Datasets Using Pointerless Sparse Voxel Octrees With Variable and Fixed-Length Encoding
    Mados, Branislav
    Adam, Norbert
    Stancel, Martin
    2021 IEEE 19TH WORLD SYMPOSIUM ON APPLIED MACHINE INTELLIGENCE AND INFORMATICS (SAMI 2021), 2021, : 343 - 348
  • [24] A real-time method for solving the forward kinematics of a tripod with fixed-length legs
    Xu, YN
    Xi, FF
    JOURNAL OF MANUFACTURING SCIENCE AND ENGINEERING-TRANSACTIONS OF THE ASME, 2006, 128 (01): : 204 - 212
  • [25] Multiplicities of sums in the explicit formulae for counting fixed length cycles in undirected graphs
    Voropaev, A. N.
    PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2011, 14 (04): : 42 - 55
  • [26] Cycle decompositions IV: complete directed graphs and fixed length directed cycles
    Alspach, B
    Gavlas, H
    Sajna, M
    Verrall, H
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2003, 103 (01) : 165 - 208
  • [27] A New Algebraic Approach to Finding all Simple Paths and Cycles in Undirected Graphs
    Yang, Runtao
    Gao, Rui
    Zhang, Chengjin
    2015 IEEE INTERNATIONAL CONFERENCE ON INFORMATION AND AUTOMATION, 2015, : 1887 - 1892
  • [28] OPTIMAL FINITE-TIME CONSENSUS ON FIXED AND PERIODIC GRAPHS
    Ghosh, Supratim
    Lee, Ji-Woong
    SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2013, 51 (05) : 3946 - 3970
  • [29] For-All Sparse Recovery in Near-Optimal Time
    Gilbert, Anna C.
    Li, Yi
    Porat, Ely
    Strauss, Martin J.
    AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT I, 2014, 8572 : 538 - 550
  • [30] For-All Sparse Recovery in Near-Optimal Time
    Gilbert, Anna C.
    Li, Yi
    Porat, Ely
    Strauss, Martin J.
    ACM TRANSACTIONS ON ALGORITHMS, 2017, 13 (03)
12345