An improved transitive closure algorithm

Name: An improved transitive closure algorithm
Creator: Schmitz, L.
Keywords: transitive reduction, Graph theory (including graph drawing) in computer science, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, digraphs, strongly connected components

Schmitz, L.

Found an issue? Give us feedback

Computingarrow_drop_down

Computing

Article . 1983 . Peer-reviewed

License: Springer TDM

Data sources: Crossref

zbMATH Open

Article . 1983

Data sources: zbMATH Open

https://dx.doi.org/10.1007/bf0...

Article

Data sources: Microsoft Academic Graph

An improved transitive closure algorithm

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1983 English Publisher:Springer Science and Business Media LLCJournal:Computing, volume 30, pages 359-371 (issn: 0010-485X, eissn: 1436-5057,

Copyright policy )

Authors: Schmitz, L.;

doi: 10.1007/bf02242140

An improved transitive closure algorithm

- Summary
- Subjects
- Metrics

Abstract

Several efficient transitive closure algorithms operate on the strongly connected components of a digraph, some of them using Tarjan's algorithm [17]. Exploiting facts from graph theory and the special properties of Tarjan's algorithm we develop a new, improved algorithm. The transitive reduction of a digraph defined in [1] may be obtained as a byproduct.

Keywords

transitive reduction, Graph theory (including graph drawing) in computer science, digraphs, strongly connected components

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	29
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average