Skip navigation
Skip navigation

Java Programs do not have bounded treewidth

Gustedt, Jens; Maehle, Ole; Telle, Jan Arne


We show that the control flow graphs of Java programs, due to the labelled break and continue statements, have no upper bound on their treewidth. A single Java method containing k labels and a loop nesting depth of k+1 can give a control-flow-graph with treewidth 2k+1.

CollectionsANU Research Publications
Date published: 2000
Type: Working/Technical Paper


File Description SizeFormat Image
TR-CS-00-01.pdf150.43 kBAdobe PDFThumbnail

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator