![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
Let A = (aij
) be a given zero-one matrix of order n and be a cyclic permutation of a subset of
. We define
, the mean weight of σ, as
and λ(A) the maximum cycle mean of A, as
. Matrices A,B are said be similar (abbr. A∼B) if one can be obtained from the other by permuting its rows and columns. We show the problem for a given matrix A to find
is NP-complete.
Keywords:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.