The Treewidth of Java Programs

@inproceedings{Gustedt2002TheTO,
  title={The Treewidth of Java Programs},
  author={Jens Gustedt and Ole A. M{\ae}hle and Jan Arne Telle},
  booktitle={ALENEX},
  year={2002}
}
Intuitively, the treewidth of a graph G measures how close G is to being a tree. The lower the treewidth, the faster we can solve various optimization problems on G, by dynamic programming along the tree structure. In the paper M.Thorup, All Structured Programs have Small Tree-Width and Good Register Allocation [8] it is shown that the control-flow graph of any goto-free C program is at most 6. This result opened for the possibility of applying the dynamic programming bounded treewidth… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 26 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Handbook of Theoretical Computer Science, volume A, chapter Graph Algorithms - Classes of graphs, pages 545–551

  • J. van Leeuwen
  • Technop ôle de Nancy-Brabois, Campus…
  • 1990
1 Excerpt

Graph minors II

  • N. Robertson, P. Seymour
  • Algorithmic aspects of tree-width. Journal of…
  • 1986
2 Excerpts

Algorithms for detecting series-parallel graphs and D-charts

  • T. Nishizeki, K. Takamizawa, N. Saito
  • Trans. Inst. Elect. Commun. Eng. Japan, 59(3):259…
  • 1976
1 Excerpt

Similar Papers

Loading similar papers…