{"id":"https://openalex.org/W3000738495","doi":"https://doi.org/10.1145/3371676.3371691","title":"A Note on Polynomial-time Solvability for Edge Packing on Graphs","display_name":"A Note on Polynomial-time Solvability for Edge Packing on Graphs","publication_year":2019,"publication_date":"2019-11-15","ids":{"openalex":"https://openalex.org/W3000738495","doi":"https://doi.org/10.1145/3371676.3371691","mag":"3000738495"},"language":"en","primary_location":{"id":"doi:10.1145/3371676.3371691","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3371676.3371691","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 9th International Conference on Communication and Network Security","raw_type":"proceedings-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/A5028620245","display_name":"Liu Jiaxin","orcid":null},"institutions":[{"id":"https://openalex.org/I10660446","display_name":"Kunming University of Science and Technology","ror":"https://ror.org/00xyeez13","country_code":"CN","type":"education","lineage":["https://openalex.org/I10660446"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jiaxin Liu","raw_affiliation_strings":["Department of Mathematics, Kunming University of Science and Technology, Kunming, Yunnan, China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Kunming University of Science and Technology, Kunming, Yunnan, China","institution_ids":["https://openalex.org/I10660446"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084480832","display_name":"Xuerong Yue","orcid":null},"institutions":[{"id":"https://openalex.org/I10660446","display_name":"Kunming University of Science and Technology","ror":"https://ror.org/00xyeez13","country_code":"CN","type":"education","lineage":["https://openalex.org/I10660446"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xuerong Yue","raw_affiliation_strings":["Department of Mathematics, Kunming University of Science and Technology, Kunming, Yunnan, China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Kunming University of Science and Technology, Kunming, Yunnan, China","institution_ids":["https://openalex.org/I10660446"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100604107","display_name":"Zhibin Chen","orcid":"https://orcid.org/0000-0003-1140-9808"},"institutions":[{"id":"https://openalex.org/I10660446","display_name":"Kunming University of Science and Technology","ror":"https://ror.org/00xyeez13","country_code":"CN","type":"education","lineage":["https://openalex.org/I10660446"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhibin Chen","raw_affiliation_strings":["Department of Mathematics, Kunming University of Science and Technology, Kunming, Yunnan, China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Kunming University of Science and Technology, Kunming, Yunnan, China","institution_ids":["https://openalex.org/I10660446"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028620245"],"corresponding_institution_ids":["https://openalex.org/I10660446"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.21866461,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"118","last_page":"122"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.994700014591217,"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/packing-problems","display_name":"Packing problems","score":0.7988261580467224},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7564561367034912},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.7027115821838379},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6885111331939697},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6087750792503357},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5782700181007385},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.5748854279518127},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.546909511089325},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.44556745886802673},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.43880680203437805},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43564194440841675},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.41576334834098816},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3562988042831421},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20892849564552307}],"concepts":[{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.7988261580467224},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7564561367034912},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.7027115821838379},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6885111331939697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6087750792503357},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5782700181007385},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.5748854279518127},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.546909511089325},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.44556745886802673},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43880680203437805},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43564194440841675},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.41576334834098816},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3562988042831421},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20892849564552307},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3371676.3371691","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3371676.3371691","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 9th International Conference on Communication and Network Security","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W2005633226","https://openalex.org/W2317309498","https://openalex.org/W2482182218","https://openalex.org/W2484325476","https://openalex.org/W2513241981","https://openalex.org/W2611804663","https://openalex.org/W2906863651","https://openalex.org/W2963988718","https://openalex.org/W3023742835","https://openalex.org/W3155009329","https://openalex.org/W4210431029","https://openalex.org/W4285540992","https://openalex.org/W4300550233"],"related_works":["https://openalex.org/W1566660502","https://openalex.org/W2056303072","https://openalex.org/W4376639639","https://openalex.org/W2036594069","https://openalex.org/W2089074354","https://openalex.org/W1580892625","https://openalex.org/W1601734754","https://openalex.org/W4294094066","https://openalex.org/W2181572306","https://openalex.org/W1562714487"],"abstract_inverted_index":{"In":[0],"this":[1,106,112],"paper,":[2],"we":[3],"consider":[4],"a":[5,15,26,44,140],"generalized":[6],"matching":[7],"problem,":[8],"the":[9,81,145],"so-called":[10],"edge":[11,31,41,78,86,92,147],"packing":[12,32,87,93,148],"problem.":[13,149],"Given":[14],"graph":[16],"G":[17,52],"such":[18,53],"that":[19,54,104,111,124,132],"each":[20,55],"vertex":[21,56],"v":[22,59],"is":[23,43,49,114],"associated":[24,72],"with":[25,34,73],"positive":[27],"integer":[28],"w(v),":[29],"an":[30,91,102],"F":[33],"respect":[35],"to":[36,61],"these":[37],"integers":[38],"(abbreviated":[39],"as":[40,96,98],"packing)":[42],"collection":[45],"of":[46,51,66],"edges":[47,95],"(repetition":[48],"allowed)":[50],"(counting":[57],"multiplicities)":[58],"belongs":[60],"at":[62],"most":[63],"w(v)":[64],"members":[65],"F.":[67],"When":[68],"all":[69],"vertices":[70],"are":[71,80],"1's":[74],"in":[75,108,127],"G,":[76],"then":[77],"packings":[79],"usual":[82],"matchings.":[83],"The":[84],"maximum":[85,146],"problem":[88,107,113],"asks":[89],"for":[90,137,144],"containing":[94],"many":[97],"possible.":[99],"We":[100],"design":[101],"algorithm":[103,119,136,143],"solves":[105],"polynomial-time,":[109],"showing":[110,131],"polynomial-time":[115,135,142],"solvable.":[116],"Furthermore,":[117],"our":[118],"relies":[120],"heavily":[121],"on":[122],"algorithms":[123],"solve":[125],"b-matching":[126,138],"strongly":[128,134,141],"polynomial":[129],"time,":[130],"any":[133],"provides":[139]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}