A finite-difference sieve to count paths and cycles by length

DOI10.1016/S0020-0190(96)00159-7MaRDI QIDQ673337zbMATH OpenOpenAlexFDO

Authors Eric Bax, Joel Franklin

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

zbMATH Keywords

AlgorithmsCombinatorial problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cites work

• A finite-difference sieve to count paths and cycles by length
• Algorithms to count paths and cycles
• Dynamic programming meets the principle of inclusion and exclusion

Cited in

(13)

• Collapsing Superstring Conjecture
• Open problems around exact algorithms
• A general purpose algorithm for counting simple cycles and simple paths of any length
• A permanent formula with many zero-valued terms
• Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
• Stability structures of conjunctive Boolean networks
• A Hopf algebra for counting cycles
• Complexity of counting cycles using zeons
• Solving the train marshalling problem by inclusion-exclusion
• On the distribution of Gini’s rank association index
• Solving SCS for bounded length strings in fewer than \(2^n\) steps
• Enumerating simple paths from connected induced subgraphs
• A finite-difference sieve to count paths and cycles by length

This page was built for publication: A finite-difference sieve to count paths and cycles by length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673337)