Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Abstract derivation of transitive closure algorithms

From MaRDI portal
Publication:287162
Jump to:navigation, search

DOI10.1016/S0020-0190(97)00113-0zbMath1337.68283OpenAlexW2005045886MaRDI QIDQ287162

Loe M. G. Feijs, R. C. van Ommering

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00113-0


zbMATH Keywords

transitive closure algorithms


Mathematics Subject Classification ID

General topics in the theory of algorithms (68W01)


Related Items

Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation. ⋮ Computationally efficient sup-t transitive closure for sparse fuzzy binary relations



Cites Work

  • Calculating path algorithms
  • A Theorem on Boolean Matrices
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Abstract derivation of transitive closure algorithms

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:287162&oldid=12171010"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 03:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki