A finite-difference sieve to count paths and cycles by length
From MaRDI portal
Publication:673337
DOI10.1016/S0020-0190(96)00159-7zbMath0900.68230OpenAlexW2051080010MaRDI 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
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items
A permanent formula with many zero-valued terms, Stability structures of conjunctive Boolean networks, A general purpose algorithm for counting simple cycles and simple paths of any length, On the distribution of Gini’s rank association index, A Hopf algebra for counting cycles, Solving SCS for bounded length strings in fewer than \(2^n\) steps, Complexity of counting cycles using zeons, Collapsing Superstring Conjecture, A finite-difference sieve to count paths and cycles by length, Open problems around exact algorithms, Solving the train marshalling problem by inclusion-exclusion, Enumerating simple paths from connected induced subgraphs, Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
Cites Work
