Determination of a circuit in a directed graph (Q3779761): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207728608926839 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2001125987 / 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: The complexity of determining a shortest cycle of even length / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algebraic determination of circuits in a directed graph / rank | |||
Normal rank | |||
Latest revision as of 15:18, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determination of a circuit in a directed graph |
scientific article |
Statements
Determination of a circuit in a directed graph (English)
0 references
1986
0 references
directed circuit
0 references
graph
0 references
algorithm
0 references
paths
0 references
