An Efficient Transitive Closure Algorithm for Cyclic Digraphs

Research output: Contribution to journalArticleScientificpeer-review

Standard

An Efficient Transitive Closure Algorithm for Cyclic Digraphs. / Nuutila, E.

In: Information Processing Letters, Vol. 52, 1994, p. 207-213.

Research output: Contribution to journalArticleScientificpeer-review

Harvard

APA

Vancouver

Author

Bibtex - Download

@article{59f85ef30bd845a7a4429337ad75dffd,
title = "An Efficient Transitive Closure Algorithm for Cyclic Digraphs",
keywords = "design of algorithms, random graphs, simulation, strong components, tarjan's algorithm, transitive closure, design of algorithms, random graphs, simulation, strong components, tarjan's algorithm, transitive closure, design of algorithms, random graphs, simulation, strong components, tarjan's algorithm, transitive closure",
author = "E. Nuutila",
year = "1994",
language = "English",
volume = "52",
pages = "207--213",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",

}

RIS - Download

TY - JOUR

T1 - An Efficient Transitive Closure Algorithm for Cyclic Digraphs

AU - Nuutila, E.

PY - 1994

Y1 - 1994

KW - design of algorithms

KW - random graphs

KW - simulation

KW - strong components

KW - tarjan's algorithm

KW - transitive closure

KW - design of algorithms

KW - random graphs

KW - simulation

KW - strong components

KW - tarjan's algorithm

KW - transitive closure

KW - design of algorithms

KW - random graphs

KW - simulation

KW - strong components

KW - tarjan's algorithm

KW - transitive closure

M3 - Article

VL - 52

SP - 207

EP - 213

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

ER -

ID: 4959510