Computing a graph's period quadratically by node condensation (Q2559390): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Arthur F. jun. Veinott / rank | |||
Property / author | |||
Property / author: Arthur F. jun. Veinott / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5611650 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient determination of the transitive closure of a directed graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A transitive closure algorithm / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:44, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing a graph's period quadratically by node condensation |
scientific article |
Statements
Computing a graph's period quadratically by node condensation (English)
0 references
1973
0 references