{"id":"https://openalex.org/W2403548643","doi":"https://doi.org/10.1007/bf02939489","title":"AnO(k 2n2) algorithm to find ak-partition in ak-connected graph","display_name":"AnO(k 2n2) algorithm to find ak-partition in ak-connected graph","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W2403548643","doi":"https://doi.org/10.1007/bf02939489","mag":"2403548643"},"language":"en","primary_location":{"id":"doi:10.1007/bf02939489","doi":"https://doi.org/10.1007/bf02939489","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02939489","pdf_url":null,"source":{"id":"https://openalex.org/S161516442","display_name":"Journal of Computer Science and Technology","issn_l":"1000-9000","issn":["1000-9000","1860-4749"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-b","cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer Science and Technology","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jun Ma","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I154099455","display_name":"Shandong University","ror":"https://ror.org/0207yh398","country_code":"CN","type":"education","lineage":["https://openalex.org/I154099455"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jun Ma","raw_affiliation_strings":["Department of Computer Science, Shandong University, 250100, Jinan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Shandong University, 250100, Jinan","institution_ids":["https://openalex.org/I154099455"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110187676","display_name":"Shaohan Ma","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I154099455","display_name":"Shandong University","ror":"https://ror.org/0207yh398","country_code":"CN","type":"education","lineage":["https://openalex.org/I154099455"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shaohan Ma","raw_affiliation_strings":["Department of Computer Science, Shandong University, 250100, Jinan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Shandong University, 250100, Jinan","institution_ids":["https://openalex.org/I154099455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154099455"],"apc_list":{"value":3090,"currency":"USD","value_usd":3090},"apc_paid":null,"fwci":0.9076,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.66489273,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":"9","issue":"1","first_page":"86","last_page":"91"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6309000253677368,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6309000253677368,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.36739999055862427,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.000699999975040555,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/k-partitions","display_name":"k-partitions","score":0.9100000262260437},{"id":"https://openalex.org/keywords/k-connected-graphs","display_name":"k-connected graphs","score":0.8080000281333923},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"vertex connectivity","score":0.9599999785423279},{"id":"https://openalex.org/keywords/graph-partitioning","display_name":"graph partitioning","score":0.675000011920929},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.8320000171661377},{"id":"https://openalex.org/keywords/biconnected-graphs","display_name":"2-connected graphs","score":0.7860000133514404},{"id":"https://openalex.org/keywords/3-connected-graphs","display_name":"3-connected graphs","score":0.9670000076293945}],"concepts":[{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.743810772895813},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7019964456558228},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6637332439422607},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.5891086459159851},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.5072929263114929},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43694132566452026},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4296191334724426},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40688133239746094},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.37882596254348755},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2586881220340729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2297987937927246},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.19670575857162476}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bf02939489","doi":"https://doi.org/10.1007/bf02939489","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02939489","pdf_url":null,"source":{"id":"https://openalex.org/S161516442","display_name":"Journal of Computer Science and Technology","issn_l":"1000-9000","issn":["1000-9000","1860-4749"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-b","cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer Science and Technology","raw_type":"journal-article"},{"id":"mag:1143838137","doi":null,"is_oa":false,"landing_page_url":"https://jcst.ict.ac.cn/CN/abstract/abstract266.shtml","pdf_url":null,"source":{"id":"https://openalex.org/S161516442","display_name":"Journal of Computer Science and Technology","issn_l":"1000-9000","issn":["1000-9000","1860-4749"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-b","cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"\u8ba1\u7b97\u673a\u79d1\u5b66\u6280\u672f\u5b66\u62a5\uff1a\u82f1\u6587\u7248","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1970776799","https://openalex.org/W1996575062","https://openalex.org/W2083409154","https://openalex.org/W3151628504"],"related_works":["https://openalex.org/W4206884261","https://openalex.org/W1949658918","https://openalex.org/W4411973470","https://openalex.org/W7100758252","https://openalex.org/W7098865982","https://openalex.org/W2234721113","https://openalex.org/W2148876978","https://openalex.org/W2077414533","https://openalex.org/W7098205153","https://openalex.org/W2997406057"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}