An algorithm for finding a circuit of even length in a directed graph (Q3342609): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207728408926635 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1981918768 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding All the Elementary Circuits of a Directed Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Algorithms for Enumerating All Circuits of a Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algebraic determination of circuits in a directed graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Cycle Vector Space Algorithm for Listing All Cycles of a Planar Graph / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:49, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for finding a circuit of even length in a directed graph |
scientific article |
Statements
An algorithm for finding a circuit of even length in a directed graph (English)
0 references
1984
0 references
directed circuit
0 references
even length
0 references
