A finite-difference sieve to count paths and cycles by length (Q673337): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Eric T. Bax / rank | |||
| Property / author | |||
| Property / author: J. N. Franklin / rank | |||
| Property / author | |||
| Property / author: Eric T. Bax / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: J. N. Franklin / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms to count paths and cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A finite-difference sieve to count paths and cycles by length / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Dynamic programming meets the principle of inclusion and exclusion / rank | |||
Normal rank | |||
Revision as of 11:24, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A finite-difference sieve to count paths and cycles by length |
scientific article |
Statements
A finite-difference sieve to count paths and cycles by length (English)
0 references
28 February 1997
0 references
Algorithms
0 references
Combinatorial problems
0 references
