Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

Graph labelings derived from models in distributed computing : a complete complexity classification.

Chalopin, J. and Paulusma, Daniel (2011) 'Graph labelings derived from models in distributed computing : a complete complexity classification.', Networks., 58 (3). pp. 207-231.


Item Type:Article
Keywords:Graph labeling, Graph homomorphism, Computational complexity, Message-passing, Local computation, Leader election, Naming.
Full text:Full text not available from this repository.
Publisher Web site:http://dx.doi.org/10.1002/net.20432
Record Created:07 Dec 2011 14:51
Last Modified:03 Apr 2013 16:19

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library