Constructive linear time algorithms for branchwidth

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/96447

Title:	Constructive linear time algorithms for branchwidth
Author:	Thilikos Touloupas, Dimitrios; Bodlaender, Hans L.
Other authors:	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
Abstract:	We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth at most k and, if so, outputs a branch decomposition of minimum width.
Subject(s):	-Àrees temàtiques de la UPC::Informàtica -Constructive linear time -Algorithms for branchwidth
Rights:
Document type:	Article - Published version Report
Share: