Solving problems for maximal reducible flowgraphs

Authors:
O. Vernet;L. Markenzon
Affiliations:
Núcleo de Computação Eletrônica, Universidade Federal do Rio de Janeiro, RJ, Brazil;Núcleo de Computação Eletrônica, Universidade Federal do Rio de Janeiro, RJ, Brazil
Venue:
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Year:
2004

Citing 11
Cited 1

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Finding a minimum feedback arc set in reducible flow graphs

Journal of Algorithms
Incremental data flow analysis via dominator and attribute update

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A minimax arc theorem for reducible flow graphs

SIAM Journal on Discrete Mathematics
An incremental algorithm for maintaining the dominator tree of a reducible flowgraph

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Incremental computation of dominator trees

IR '95 Papers from the 1995 ACM SIGPLAN workshop on Intermediate representations
Efficient program analysis using DJ graphs

Efficient program analysis using DJ graphs
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Characterizations of Reducible Flow Graphs

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Hamiltonian problems for reducible flowgraphs

SCCC '97 Proceedings of the 17th International Conference of the Chilean Computer Science Society

A new elimination-based data flow analysis framework using annotated decomposition trees

CC'07 Proceedings of the 16th international conference on Compiler construction

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the family of Maximal Reducible Flowgraphs (MRFs) is recursively defined, based on a decomposition theorem. A one-to-one association between MRFs and extended binary trees allows to deduce some numerical properties of the family. Hamiltonian problems, testing isomorphism and finding a minimum cardinality feedback arc set are efficiently solved for MRFs. The results concerning hamiltonian paths and cycles also hold for reducible flowgraphs.