Testing flow graph reducibility (Q1221484)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Testing flow graph reducibility	scientific article

Statements

scholarly article

0 references

Testing flow graph reducibility (English)

0 references

Journal of Computer and System Sciences

0 references

publication date

1974

0 references

Robert Endre Tarjan

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

Fast algorithms for the elimination of common subexpressions

0 references

A global flow analysis algorithm

0 references

0 references

0 references

Flow Graph Reducibility

0 references

Characterizations of Reducible Flow Graphs

0 references

Depth-First Search and Linear Graph Algorithms

0 references

Finding Dominators in Directed Graphs

0 references

Efficiency of Equivalence Algorithms

0 references

Set Merging Algorithms

0 references

Efficiency of a Good But Not Linear Set Union Algorithm

0 references

0 references

0 references

full work available at URL

https://doi.org/10.1016/s0022-0000(74)80049-8

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0022-0000(74)80049-8

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1221484

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1221484&oldid=37437586"