A finite-difference sieve to count paths and cycles by length
From MaRDI portal
Publication:673337
DOI10.1016/S0020-0190(96)00159-7zbMath0900.68230MaRDI QIDQ673337
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00159-7
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
Related Items
Collapsing Superstring Conjecture, A permanent formula with many zero-valued terms, Solving the train marshalling problem by inclusion-exclusion, Complexity of counting cycles using zeons, A finite-difference sieve to count paths and cycles by length, Stability structures of conjunctive Boolean networks, A Hopf algebra for counting cycles, Enumerating simple paths from connected induced subgraphs, Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants, A general purpose algorithm for counting simple cycles and simple paths of any length, Solving SCS for bounded length strings in fewer than \(2^n\) steps, Open problems around exact algorithms
Cites Work