CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Filters
5 research outputs found
An algorithm for transitive reduction of an acyclic graph
Author
Gries David
Martin Alain J.
Udding Jan Tijmen
van de Snepscheut Jan L.A.
Publication venue
Published by Elsevier B.V.
Publication date
Field of study
Get PDF
Elsevier - Publisher Connector
Inversion of a recursive tree traversal
Author
Burgdorff
Chen
+6Â more
Chen
Dijkstra
Gries
Gries
Jan L.A. van de Snepscheut
Knuth
Publication venue
'Elsevier BV'
Publication date
Field of study
Full text link
Crossref
A derivation of a distributed implementation of Warshall's algorithm
Author
van de Snepscheut Jan L.A.
Publication venue
Published by Elsevier B.V.
Publication date
31/12/1986
Field of study
Get PDF
AbstractWarshall's agorithm is an efficient algorithm for computing the transitive closure of a binary relation. In this note we derive a distributed implementation of this algorithm
Elsevier - Publisher Connector
Inorder Traversal of a Binary Tree and its Inversion
Author
Gries David
Van de Snepscheut Jan L.A.
Publication venue
'SAGE Publications'
Publication date
01/11/1987
Field of study
Full text link
ABSTRACT NOT AVAILABL
eCommons@Cornell
A derivation of a distributed implementation of Warshall's algorithm
Author
Guibas
Jan L.A. van de Snepscheut
van Scoy
Warshall
Publication venue
'Elsevier BV'
Publication date
01/01/1986
Field of study
No full text
Crossref
Get PDF
