Complexity analysis of a decentralised graph colouring algorithm K. R. Duffy(1) , N. O’Connell(2) and A. Sapozhnikov(3)

First Page		Document Content
Date: 2009-06-19 10:59:28 Graph coloring NP-complete problems Analysis of algorithms SL Randomized algorithm Path decomposition Tree decomposition Theoretical computer science Graph theory Mathematics		Complexity analysis of a decentralised graph colouring algorithm K. R. Duffy(1) , N. O’Connell(2) and A. Sapozhnikov(3) Add to Reading List Source URL: www.hamilton.ie Download Document from Source Website File Size: 147,36 KB Share Document on Facebook

	Algorithms for subnetwork mining in heterogeneous networks Guillaume Fertin, Hafedh Mohamed-Babou and Irena Rusu LINA, UMR 6241, Universit´e de Nantes, France {Guillaume.Fertin, Hafedh.Mohamed-Babou, Irena.Rusu}@univ-na DocID: 1qSPm - View Document
	An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de DocID: 1qMfK - View Document
	A Linear-Time Algorithm for Network Decomposition Lenore J. Cowen Department of Mathematical Sciences The Johns Hopkins University Baltimore, MD 21218 DocID: 1qJe2 - View Document
	Joint Energy Management and Resource Allocation in Rechargeable Sensor Networks Ren-Shiou Liu Prasun Sinha DocID: 1qqkW - View Document
	Graph Editing to a Given Degree Sequence? Petr A. Golovach1,2 and George B. Mertzios3 1 Department of Informatics, University of Bergen, Norway, . 2 DocID: 1qiDH - View Document