{"id":"https://openalex.org/W2067121839","doi":"https://doi.org/10.1080/00207160802562523","title":"Algorithms for (0, 1,<i>d</i>)-graphs with<i>d</i>constrains","display_name":"Algorithms for (0, 1,<i>d</i>)-graphs with<i>d</i>constrains","publication_year":2009,"publication_date":"2009-07-24","ids":{"openalex":"https://openalex.org/W2067121839","doi":"https://doi.org/10.1080/00207160802562523","mag":"2067121839"},"language":"he","primary_location":{"id":"doi:10.1080/00207160802562523","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160802562523","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5101740567","display_name":"Yueping Li","orcid":"https://orcid.org/0000-0003-2816-6208"},"institutions":[{"id":"https://openalex.org/I157773358","display_name":"Sun Yat-sen University","ror":"https://ror.org/0064kty71","country_code":"CN","type":"education","lineage":["https://openalex.org/I157773358"]},{"id":"https://openalex.org/I182722699","display_name":"Shenzhen Polytechnic","ror":"https://ror.org/00d2w9g53","country_code":"CN","type":"education","lineage":["https://openalex.org/I182722699"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yueping Li","raw_affiliation_strings":["School of Electronics and Information Engineering , Shenzhen Polytechnic Shenzhen , Guangdong, 518055, P.R. China ; Department of Computer Science , Sun Yat-sen University , Guangzhou, 510275, P.R. China","School of Electronics and Information Engineering , Shenzhen Polytechnic Shenzhen , Guangdong, 518055, P.R. China","Department of Computer Science , Sun Yat-sen University , Guangzhou, 510275, P.R. China"],"affiliations":[{"raw_affiliation_string":"School of Electronics and Information Engineering , Shenzhen Polytechnic Shenzhen , Guangdong, 518055, P.R. China ; Department of Computer Science , Sun Yat-sen University , Guangzhou, 510275, P.R. China","institution_ids":["https://openalex.org/I157773358","https://openalex.org/I182722699"]},{"raw_affiliation_string":"School of Electronics and Information Engineering , Shenzhen Polytechnic Shenzhen , Guangdong, 518055, P.R. China","institution_ids":["https://openalex.org/I182722699"]},{"raw_affiliation_string":"Department of Computer Science , Sun Yat-sen University , Guangzhou, 510275, P.R. China","institution_ids":["https://openalex.org/I157773358"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017147782","display_name":"Dingjun Lou","orcid":null},"institutions":[{"id":"https://openalex.org/I157773358","display_name":"Sun Yat-sen University","ror":"https://ror.org/0064kty71","country_code":"CN","type":"education","lineage":["https://openalex.org/I157773358"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Dingjun Lou","raw_affiliation_strings":["Department of Computer Science , Sun Yat-sen University , Guangzhou, 510275, P.R. China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science , Sun Yat-sen University , Guangzhou, 510275, P.R. China","institution_ids":["https://openalex.org/I157773358"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061255464","display_name":"Yunting Lu","orcid":null},"institutions":[{"id":"https://openalex.org/I158809036","display_name":"Shenzhen Institute of Information Technology","ror":"https://ror.org/03wrf9427","country_code":"CN","type":"education","lineage":["https://openalex.org/I158809036"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yunting Lu","raw_affiliation_strings":["Shenzhen Institute of Information Technology , Shenzhen, 518029, P.R. China"],"affiliations":[{"raw_affiliation_string":"Shenzhen Institute of Information Technology , Shenzhen, 518029, P.R. China","institution_ids":["https://openalex.org/I158809036"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101740567"],"corresponding_institution_ids":["https://openalex.org/I157773358","https://openalex.org/I182722699"],"apc_list":null,"apc_paid":null,"fwci":0.3428,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.6105746,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"87","issue":"8","first_page":"1680","last_page":"1691"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9994999766349792,"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.9983000159263611,"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/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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/combinatorics","display_name":"Combinatorics","score":0.8658854961395264},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7392630577087402},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6976563930511475},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5801992416381836},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5781162977218628},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5179935693740845},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.4974232017993927},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.4284713864326477},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3978150486946106},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.275519996881485},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.23590612411499023}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8658854961395264},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7392630577087402},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6976563930511475},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5801992416381836},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5781162977218628},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5179935693740845},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.4974232017993927},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.4284713864326477},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3978150486946106},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.275519996881485},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.23590612411499023},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160802562523","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160802562523","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.6600000262260437}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W2553744","https://openalex.org/W108493889","https://openalex.org/W1503654174","https://openalex.org/W2006993022","https://openalex.org/W2042811967","https://openalex.org/W2044545593","https://openalex.org/W2059598363","https://openalex.org/W2063889627","https://openalex.org/W2082976715","https://openalex.org/W2091978516","https://openalex.org/W2092837495","https://openalex.org/W2095100606","https://openalex.org/W2165352378","https://openalex.org/W2170132163"],"related_works":["https://openalex.org/W2567825307","https://openalex.org/W4295762832","https://openalex.org/W1592682627","https://openalex.org/W2362975861","https://openalex.org/W2054458431","https://openalex.org/W2804963084","https://openalex.org/W2364074136","https://openalex.org/W2371352078","https://openalex.org/W4320022211","https://openalex.org/W2071364952"],"abstract_inverted_index":{"Let":[0,9],"G":[1,63],"be":[2,13,56,67,97],"a":[3,32,47,59,91,98],"graph":[4,93],"with":[5,81],"vertex":[6],"set":[7],"V(G).":[8],"n,":[10],"k,":[11,70],"d":[12,82],"non-negative":[14],"integers":[15],"such":[16],"that":[17],"n+2k+d\u2264|V(G)|\u22122":[18],"and":[19,52],"|V(G)|\u2212n\u2212d":[20],"are":[21],"even.":[22],"A":[23],"matching":[24,34,48],"which":[25],"saturates":[26],"exactly":[27],"|V(G)|\u2212d":[28],"vertices":[29,42],"is":[30,64,111],"called":[31],"defect-d":[33,60],"of":[35,49,89,121,128],"G.":[36],"If":[37],"when":[38],"deleting":[39],"any":[40],"n":[41],"the":[43,87,114,119,126],"remaining":[44],"subgraph":[45],"contains":[46],"k":[50],"edges":[51],"every":[53],"k-matching":[54],"can":[55],"extended":[57],"to":[58,66,76,96,113],"matching,":[61],"then":[62],"said":[65],"an":[68,74],"(n,":[69],"d)-graph.":[71],"We":[72],"present":[73],"algorithm":[75],"determine":[77],"(0,":[78,99],"1,":[79,100],"d)-graphs":[80],"constraints.":[83],"Moreover,":[84],"we":[85],"solve":[86],"problem":[88,110],"augmenting":[90],"bipartite":[92],"G=(B,":[94],"W)":[95],"d)-graph":[101],"by":[102],"adding":[103],"fewest":[104],"edges,":[105],"where":[106,118],"d=\u2225B|\u2212|W\u2225.":[107],"The":[108],"latter":[109],"applicable":[112],"job":[115],"assignment":[116],"problem,":[117],"number":[120,127],"jobs":[122],"does":[123],"not":[124],"equal":[125],"persons.":[129]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}