Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs (Q4271085): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/153724.153727 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026261955 / rank | |||
Normal rank | |||
Latest revision as of 20:08, 19 March 2024
scientific article; zbMATH DE number 459163
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs |
scientific article; zbMATH DE number 459163 |
Statements
Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs (English)
0 references
24 February 1994
0 references
periodic graphs
0 references
recurrences and difference equations
0 references
graph algorithms
0 references
paths and circuit problem
0 references
trees
0 references
application of multidimensional search
0 references
application of parametric method
0 references
combinatorial algorithm
0 references
