Directed circuits on a torus (Q1180428): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q516046 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: David P. Brown / rank | |||
Normal rank | |||
Revision as of 01:54, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Directed circuits on a torus |
scientific article |
Statements
Directed circuits on a torus (English)
0 references
27 June 1992
0 references
The author gives a polynomial algorithm for deciding if any two vertices of a digraph lie in a directed circuit. In addition, a polynomial algorithm is given for deciding the presence of a collection of disjoint directed circuits of prescribed homotopy in a digraph drawn on a torus.
0 references
digraph
0 references
circuits
0 references
