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 条
  • [41] Multi-label Arrhythmia Classification from Fixed-length Compressed ECG Segments in Real-time Wearable ECG Monitoring
    Cheng, Yunfei
    Ye, Yalan
    Hou, Mengshu
    He, Wenwen
    Pan, Tongjie
    42ND ANNUAL INTERNATIONAL CONFERENCES OF THE IEEE ENGINEERING IN MEDICINE AND BIOLOGY SOCIETY: ENABLING INNOVATIVE TECHNOLOGIES FOR GLOBAL HEALTHCARE EMBC'20, 2020, : 580 - 583
  • [42] An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three
    Frieze, Alan
    Haber, Simi
    RANDOM STRUCTURES & ALGORITHMS, 2015, 47 (01) : 73 - 98
  • [43] An Optimal Inventory Replenishment Policy for a Perishable Item with Time Quadratic Demand and Partial Backlogging with Shortages in All Cycles
    Roy Chowdhury R.
    Ghosh S.K.
    Chaudhuri K.S.
    International Journal of Applied and Computational Mathematics, 2017, 3 (2) : 1001 - 1017
  • [44] NON-MINIMAL REALIZATIONS OF FIXED-POINT DIGITAL FILTERS THAT ARE FREE OF ALL FINITE WORD-LENGTH LIMIT CYCLES.
    Fam, Adly T.
    Barnes, Casper W.
    1978, : 244 - 248
  • [45] NON-MINIMAL REALIZATIONS OF FIXED-POINT DIGITAL-FILTERS THAT ARE FREE OF ALL FINITE WORD-LENGTH LIMIT-CYCLES
    FAM, AT
    BARNES, CW
    IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1979, 27 (02): : 149 - 153
  • [46] An optimal inventory replenishment policy for a deteriorating item with time-quadratic demand and time-dependent partial backlogging with shortages in all cycles
    Sarkar, T.
    Ghosh, S. K.
    Chaudhuri, K. S.
    APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (18) : 9147 - 9155
  • [47] Fixed-rate-breaking All-optical OFDM System using Time-domain Hybrid PAM with Sparse Subcarrier Multiplexing and Power-loading for Optical Short-reach Transmission
    Kodama, Takahiro
    Maruta, Akihiro
    Wada, Naoya
    Cincotti, Gabriella
    2020 OPTICAL FIBER COMMUNICATIONS CONFERENCE AND EXPOSITION (OFC), 2020,
12345