Skip to main content

Breaking symmetry in complete graphs by orienting edges: asymptotic bounds

Download / Buy Article:

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.

Proceed

Keywords: Algorithms; Asymptotic bound; Computational complexity; Identity orientation

Document Type: Short Communication

DOI: http://dx.doi.org/10.1016/S0020-0190(98)00124-0

Affiliations: Department of Computer Science, New Mexico State University, Las Cruces, NM 88003, USA

Publication date: September 15, 1998

els/00200190/1998/00000067/00000005/art00124
dcterms_title,dcterms_description,pub_keyword
6
5
20
40
5

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more