Cite
Complexity analysis of a decentralised graph colouring algorithm
MLA
Artem Sapozhnikov, et al. Complexity Analysis of a Decentralised Graph Colouring Algorithm. Jan. 2008. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsair&AN=edsair.doi.dedup.....6a57a8470fcf6cf8311d6d1a442ef61c&authtype=sso&custid=ns315887.
APA
Artem Sapozhnikov, Ken R. Duffy, & Neil O’Connell. (2008). Complexity analysis of a decentralised graph colouring algorithm.
Chicago
Artem Sapozhnikov, Ken R. Duffy, and Neil O’Connell. 2008. “Complexity Analysis of a Decentralised Graph Colouring Algorithm,” January. http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsair&AN=edsair.doi.dedup.....6a57a8470fcf6cf8311d6d1a442ef61c&authtype=sso&custid=ns315887.