Amanote Research

Amanote Research

  • Register
  • Sign In

A Transitive Closure Algorithm

BIT Numerical Mathematics- Netherlands

doi 10.1007/bf01940892

Full Text

Abstract

Available in

Categories

Computer NetworksApplied MathematicsSoftwareComputational MathematicsCommunications

Date

March 1, 1970

Authors

Paul Purdom

Publisher

Springer Science and Business Media LLC


Related search

Algorithm 36. Transitive Closure of a Graph

Applicationes Mathematicae
1974English

Transitive-Closure Spanners

2009English

Graph Encoding and Transitive Closure Representation

English

TCG: A Transitive Closure Graph-Based Representation for Non-Slicing Floorplans

English

Event Matching Using the Transitive Closure of Dependency Relations

2008English

Lower Bounds for Local Monotonicity Reconstruction From Transitive-Closure Spanners

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Improved Deterministic Algorithms for Decremental Transitive Closure and Strongly Connected Components

2011English

Transitive Closure Based Visual Words for Point Matching in Video Sequence

2010English

Arbitrarily Shaped Rectilinear Module Placement Using the Transitive Closure Graph Representation

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
HardwareElectronic EngineeringElectricalArchitectureSoftware
2002English

Amanote Research

Note-taking for researchers

Follow Amanote


© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy