ŚüļšļéŚĪĝɮśúČťôźśźúÁīĘÁöĄśó†ŚźĎŚõĺŤŅĎšľľśúÄŚ§ßŚõĘŚŅęťÄüśĪāŤß£Áģóś≥ē (Quick Algorithm to Find an Approximate Maximum Clique in Undirected Graph by Using Local-limited Search Strategy).
ŚüļšļéŚĪĝɮśúČťôźśźúÁīĘÁöĄśó†ŚźĎŚõĺŤŅĎšľľśúÄŚ§ßŚõĘŚŅęťÄüśĪāŤß£Áģóś≥ē (Quick Algorithm to Find an Approximate Maximum Clique in Undirected Graph by Using Local-limited Search Strategy).
(xsd:string)
ŚüļšļéŚĪĝɮśúČťôźśźúÁīĘÁöĄśó†ŚźĎŚõĺŤŅĎšľľśúÄŚ§ßŚõĘŚŅęťÄüśĪāŤß£Áģóś≥ē (Quick Algorithm to Find an Approximate Maximum Clique in Undirected Graph by Using Local-limited Search Strategy).
(xsd:string)