Gustedt, JensMaehle, OleTelle, Jan Arne2003-07-032004-05-192011-01-052004-05-192011-01-052000http://hdl.handle.net/1885/40731http://digitalcollections.anu.edu.au/handle/1885/40731We 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.154043 bytes356 bytesapplication/pdfapplication/octet-streamen-AUjavacontrol-flow graphtreewidth,TR-CS2000