{"id":"https://openalex.org/W2115941896","doi":"https://doi.org/10.4304/jcp.6.8.1781-1788","title":"An Algorithm for Minimum Vertex Cover Based on Max-I Share Degree","display_name":"An Algorithm for Minimum Vertex Cover Based on Max-I Share Degree","publication_year":2011,"publication_date":"2011-08-01","ids":{"openalex":"https://openalex.org/W2115941896","doi":"https://doi.org/10.4304/jcp.6.8.1781-1788","mag":"2115941896"},"language":"en","primary_location":{"id":"doi:10.4304/jcp.6.8.1781-1788","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jcp.6.8.1781-1788","pdf_url":null,"source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computers","raw_type":"journal-article"},"type":"article","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":"https://openalex.org/A5100367940","display_name":"Shaohua Li","orcid":"https://orcid.org/0000-0001-8079-6405"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Shaohua Li","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100438360","display_name":"Jianxin Wang","orcid":"https://orcid.org/0000-0003-1516-0480"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jianxin Wang","raw_affiliation_strings":["central south university"],"affiliations":[{"raw_affiliation_string":"central south university","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023394727","display_name":"Jianer Chen","orcid":"https://orcid.org/0000-0003-0898-1643"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jianer Chen","raw_affiliation_strings":["central south university"],"affiliations":[{"raw_affiliation_string":"central south university","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074548044","display_name":"Zhijian Wang","orcid":"https://orcid.org/0000-0002-6507-1737"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhijian Wang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100367940"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.15726162,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"6","issue":"8","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980999827384949,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9980999827384949,"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/T12288","display_name":"Optimization and Search Problems","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11478","display_name":"Caching and Content Delivery","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/degree","display_name":"Degree (music)","score":0.6860562562942505},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5955564379692078},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5560904741287231},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5374408960342407},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5158931016921997},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4874430000782013},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39305737614631653},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35696136951446533},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15006345510482788},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.13489046692848206},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08047553896903992},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.03974783420562744}],"concepts":[{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6860562562942505},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5955564379692078},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5560904741287231},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5374408960342407},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5158931016921997},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4874430000782013},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39305737614631653},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35696136951446533},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15006345510482788},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.13489046692848206},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08047553896903992},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.03974783420562744},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4304/jcp.6.8.1781-1788","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jcp.6.8.1781-1788","pdf_url":null,"source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.44999998807907104,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1973310391","https://openalex.org/W1975442866","https://openalex.org/W1982180670","https://openalex.org/W1986447712","https://openalex.org/W2030970869","https://openalex.org/W2038225707","https://openalex.org/W2143698439","https://openalex.org/W2156760067","https://openalex.org/W2158584754","https://openalex.org/W2351895764","https://openalex.org/W2363330530","https://openalex.org/W2378440504","https://openalex.org/W2393799448","https://openalex.org/W2913688336","https://openalex.org/W3145128584","https://openalex.org/W3149604617","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1566660502","https://openalex.org/W2156896570","https://openalex.org/W3161230432","https://openalex.org/W623607250","https://openalex.org/W2036594069","https://openalex.org/W2168711306","https://openalex.org/W4245505501","https://openalex.org/W3111015064","https://openalex.org/W4255529442","https://openalex.org/W4212927854"],"abstract_inverted_index":{"Minimum":[0],"vertex":[1,15,32,57],"cover":[2],"problem(Min-VC)":[3],"on":[4,64],"a":[5,8,14,56,68],"graph":[6],"is":[7,33,46,71,80,83,101,112,126],"NP-hard":[9],"problem.":[10],"The":[11],"neighborhoods":[12],"of":[13,42,55,93,106],"are":[16,23],"analyzed":[17],"in":[18,49],"this":[19],"paper,":[20],"and":[21,97],"so":[22],"the":[24,31,40,53,88,98,110,123],"information":[25],"they":[26],"hold":[27],"for":[28],"judging":[29],"whether":[30],"belong":[34],"to":[35,51,58,85],"Min-VC":[36,90],"or":[37],"not.":[38],"Then,":[39],"concept":[41],"Max-I":[43,65],"share":[44,66],"degree":[45,100],"put":[47],"forword":[48],"order":[50],"qualify":[52],"possibility":[54],"be":[59],"collected":[60],"into":[61],"Min-VC.":[62],"Based":[63],"degree,":[67],"heuristic":[69],"algorithm":[70,74],"proposed.":[72],"Our":[73],"has":[75,115],"two":[76],"remarkable":[77],"characteristics:":[78],"one":[79],"that":[81,92,105,113,122],"it":[82,114],"able":[84],"get":[86],"almost":[87],"same":[89],"as":[91],"an":[94],"exact":[95],"algorithm,":[96],"approximation":[99,108],"obviously":[102],"better":[103],"than":[104,129],"other":[107,111,132],"algorithms;":[109],"polynomial":[116],"time":[117,125],"complexity.":[118],"Emulational":[119],"results":[120],"show":[121],"running":[124],"significantly":[127],"less":[128],"those":[130],"of\u00a0":[131],"algorithms.":[133]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}