{"id":"https://openalex.org/W4394576960","doi":"https://doi.org/10.1142/s0219265924500063","title":"Graph Bipartization and Via Minimization for Intersection Graphs","display_name":"Graph Bipartization and Via Minimization for Intersection Graphs","publication_year":2024,"publication_date":"2024-04-06","ids":{"openalex":"https://openalex.org/W4394576960","doi":"https://doi.org/10.1142/s0219265924500063"},"language":"en","primary_location":{"id":"doi:10.1142/s0219265924500063","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265924500063","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Interconnection Networks","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/A5038409760","display_name":"Lan Lin","orcid":"https://orcid.org/0000-0003-2218-2506"},"institutions":[{"id":"https://openalex.org/I116953780","display_name":"Tongji University","ror":"https://ror.org/03rc6as71","country_code":"CN","type":"education","lineage":["https://openalex.org/I116953780"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Lan Lin","raw_affiliation_strings":["School of Electronics and Information Engineering, Tongji University, Shanghai 200092, P. R. China"],"raw_orcid":"https://orcid.org/0000-0003-2218-2506","affiliations":[{"raw_affiliation_string":"School of Electronics and Information Engineering, Tongji University, Shanghai 200092, P. R. China","institution_ids":["https://openalex.org/I116953780"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055656105","display_name":"Yixun Lin","orcid":"https://orcid.org/0000-0002-4807-1735"},"institutions":[{"id":"https://openalex.org/I38877650","display_name":"Zhengzhou University","ror":"https://ror.org/04ypx8c21","country_code":"CN","type":"education","lineage":["https://openalex.org/I38877650"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yixun Lin","raw_affiliation_strings":["School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan 450001, P. R. China"],"raw_orcid":"https://orcid.org/0000-0002-4807-1735","affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan 450001, P. R. China","institution_ids":["https://openalex.org/I38877650"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038409760"],"corresponding_institution_ids":["https://openalex.org/I116953780"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05816374,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":"02","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.9909999966621399,"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.9909999966621399,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9570000171661377,"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.9004999995231628,"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/intersection","display_name":"Intersection (aeronautics)","score":0.6233372092247009},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5467584729194641},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5286161303520203},{"id":"https://openalex.org/keywords/intersection-graph","display_name":"Intersection graph","score":0.47011247277259827},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.46346062421798706},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4131203293800354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3373388946056366},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2809811532497406},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23092618584632874},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.07760897278785706},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.06148400902748108}],"concepts":[{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6233372092247009},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5467584729194641},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5286161303520203},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.47011247277259827},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.46346062421798706},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4131203293800354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3373388946056366},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2809811532497406},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23092618584632874},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.07760897278785706},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.06148400902748108},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0219265924500063","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265924500063","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Interconnection Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1881199462","display_name":null,"funder_award_id":"2019YFB2101604","funder_id":"https://openalex.org/F4320335774","funder_display_name":"Key Technologies Research and Development Program"}],"funders":[{"id":"https://openalex.org/F4320335774","display_name":"Key Technologies Research and Development Program","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1552512816","https://openalex.org/W1978838869","https://openalex.org/W1991223992","https://openalex.org/W1993412054","https://openalex.org/W2012357906","https://openalex.org/W2045302173","https://openalex.org/W2051856222","https://openalex.org/W2102669784","https://openalex.org/W2104881193","https://openalex.org/W2112942252","https://openalex.org/W2132816737","https://openalex.org/W2160399627","https://openalex.org/W2170359320","https://openalex.org/W2992705078","https://openalex.org/W3004088662","https://openalex.org/W4232896595","https://openalex.org/W4287219802"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2134744951","https://openalex.org/W2064150325","https://openalex.org/W2952898486","https://openalex.org/W1893408579","https://openalex.org/W4299622024","https://openalex.org/W2950502967","https://openalex.org/W4226304728","https://openalex.org/W2953260685","https://openalex.org/W2362473619"],"abstract_inverted_index":{"The":[0,44],"graph":[1,24,70,86],"bipartization":[2],"problem,":[3],"arising":[4],"from":[5],"via":[6],"minimization":[7],"in":[8,15,74,107],"VLSI":[9],"design":[10],"and":[11,38,56,77,94,109,120],"related":[12],"areas,":[13],"consists":[14],"finding":[16],"a":[17],"vertex":[18],"subset":[19],"[Formula:":[20,25,33,39],"see":[21,26,34,40],"text]":[22,27,35,41],"of":[23,65],"such":[28,88],"that":[29,127],"the":[30,60,63,99,104,111,130],"induced":[31],"subgraph":[32],"is":[36,42,72],"bipartite":[37],"maximized.":[43],"problem":[45],"has":[46],"been":[47],"proved":[48],"to":[49],"be":[50],"NP-hard":[51],"even":[52],"for":[53,68,114],"planar":[54],"graphs":[55,119],"cubic":[57],"graphs.":[58,97],"On":[59],"other":[61],"hand,":[62],"study":[64],"polynomial-time":[66,112],"algorithms":[67,113,126],"typical":[69],"classes":[71],"significant":[73],"both":[75],"theoretical":[76],"applied":[78],"aspects.":[79],"This":[80],"paper":[81],"focuses":[82],"on":[83,129],"several":[84],"intersection":[85],"classes,":[87],"as":[89],"line":[90,100],"graphs,":[91,93,101,123],"circular-arc":[92,118],"directed":[95,121],"path":[96,122],"For":[98,117],"we":[102,124],"show":[103],"NP-hardness":[105],"results":[106],"general":[108],"present":[110],"special":[115],"cases.":[116],"propose":[125],"improve":[128],"previously":[131],"known":[132],"ones.":[133]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}