Amanote Research

Amanote Research

    RegisterSign In

Optimizing Numerical Code by Means of the Transitive Closure of Dependence Graphs

doi 10.15439/2017f19
Full Text
Open PDF
Abstract

Available in full text

Date

September 24, 2017

Authors
Marek PalkowskiWlodzimierz Bielecki
Publisher

IEEE


Related search

Symmetry-Aware Placement With Transitive Closure Graphs for Analog Layout Design

2008English

Transitive-Closure Spanners

2009English

A Transitive Closure Algorithm

BIT Numerical Mathematics
Computer NetworksApplied MathematicsSoftwareComputational MathematicsCommunications
1970English

Hexavalent (G, S)-Transitive Graphs

Czechoslovak Mathematical Journal
Mathematics
2013English

On Criterion of Arc-Transitive Cayley Graphs

Pure Mathematics
2017English

On Making Directed Graphs Transitive

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Almost Covers of 2-Arc Transitive Graphs

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
2007English

Algorithm 36. Transitive Closure of a Graph

Applicationes Mathematicae
1974English

Event Matching Using the Transitive Closure of Dependency Relations

2008English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy