{"id":"https://openalex.org/W2345881920","doi":"https://doi.org/10.3233/fi-2016-1347","title":"A Generalization of Join and an Algorithmic Recognition Problem","display_name":"A Generalization of Join and an Algorithmic Recognition Problem","publication_year":2016,"publication_date":"2016-05-03","ids":{"openalex":"https://openalex.org/W2345881920","doi":"https://doi.org/10.3233/fi-2016-1347","mag":"2345881920"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2016-1347","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2016-1347","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","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/A5074485558","display_name":"M. A. Shalu","orcid":null},"institutions":[{"id":"https://openalex.org/I39244652","display_name":"Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram","ror":"https://ror.org/023c9pb11","country_code":"IN","type":"education","lineage":["https://openalex.org/I39244652"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"M.A. Shalu","raw_affiliation_strings":["Indian Institute of Information Technology Design & Manufacturing (IIITD&M) Kancheepuram, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Information Technology Design & Manufacturing (IIITD&M) Kancheepuram, Chennai, India","institution_ids":["https://openalex.org/I39244652"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014505220","display_name":"S. Devi Yamini","orcid":null},"institutions":[{"id":"https://openalex.org/I39244652","display_name":"Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram","ror":"https://ror.org/023c9pb11","country_code":"IN","type":"education","lineage":["https://openalex.org/I39244652"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"S. Devi Yamini","raw_affiliation_strings":["Indian Institute of Information Technology Design & Manufacturing (IIITD&M) Kancheepuram, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Information Technology Design & Manufacturing (IIITD&M) Kancheepuram, Chennai, India","institution_ids":["https://openalex.org/I39244652"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074485558"],"corresponding_institution_ids":["https://openalex.org/I39244652"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04474017,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"145","issue":"1","first_page":"81","last_page":"91"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9986000061035156,"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.9983999729156494,"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/combinatorics","display_name":"Combinatorics","score":0.7716857194900513},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.7134015560150146},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5712915658950806},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.5529834032058716},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5379318594932556},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4969175159931183},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.49487704038619995},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.47666338086128235},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.47063419222831726},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4206279516220093},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34857216477394104},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.24977734684944153},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.23643016815185547}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7716857194900513},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.7134015560150146},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5712915658950806},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.5529834032058716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5379318594932556},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4969175159931183},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.49487704038619995},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.47666338086128235},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.47063419222831726},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4206279516220093},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34857216477394104},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.24977734684944153},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.23643016815185547}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/fi-2016-1347","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2016-1347","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W232959721","https://openalex.org/W393416684","https://openalex.org/W593236292","https://openalex.org/W1479863711","https://openalex.org/W1558167226","https://openalex.org/W1579049696","https://openalex.org/W1661437722","https://openalex.org/W1880646138","https://openalex.org/W1933165643","https://openalex.org/W1974006935","https://openalex.org/W2000763343","https://openalex.org/W2003177089","https://openalex.org/W2009300407","https://openalex.org/W2015452703","https://openalex.org/W2015769804","https://openalex.org/W2028449252","https://openalex.org/W2028775537","https://openalex.org/W2034950274","https://openalex.org/W2072408231","https://openalex.org/W2082819223","https://openalex.org/W2087723085","https://openalex.org/W2100432797","https://openalex.org/W2112553449","https://openalex.org/W2132095827","https://openalex.org/W2140934298","https://openalex.org/W2143070962","https://openalex.org/W2165619621","https://openalex.org/W2170633983","https://openalex.org/W2949563131"],"related_works":["https://openalex.org/W3139101777","https://openalex.org/W2963009577","https://openalex.org/W4385327816","https://openalex.org/W2788975631","https://openalex.org/W2061237693","https://openalex.org/W2903402681","https://openalex.org/W2083238533","https://openalex.org/W2125939925","https://openalex.org/W2888394449","https://openalex.org/W2132199417"],"abstract_inverted_index":{"We":[0,14,134],"consider":[1],"a":[2,31,40],"new":[3],"graph":[4,81],"operation":[5],"c":[6,26,41,109],"2":[7,27,42,110],"-join":[8,28,111],"which":[9],"generalizes":[10],"join":[11],"and":[12,29,61,91,130,147],"co-join.":[13],"show":[15,135],"that":[16,38,82,136],"odd":[17,69,79,85,117],"hole-free":[18,70,80],"graphs":[19,37,71,99],"(odd":[20],"antihole-free":[21],"graphs)":[22],"are":[23,72],"closed":[24],"under":[25],"describe":[30],"polynomial":[32],"time":[33,45],"algorithm":[34],"to":[35],"recognize":[36],"admit":[39],"-join.":[43],"The":[44],"complexity":[46],"of":[47,97,105,126],"the":[48,95,102,137],"(":[49,53,62],"a)":[50],"recognition":[51],"problem,":[52,60,139,144,146],"b)":[54],"maximum":[55,140],"weight":[56,141],"independent":[57],"set":[58],"(MWIS)":[59],"c)":[63],"minimum":[64,148],"coloring":[65],"(MC)":[66],"problem":[67,152],"for":[68,157],"still":[73],"unknown.":[74],"Let":[75],"H":[76,93,106,115,159],"be":[77,94,154],"an":[78,84,88],"contains":[83,119],"antihole":[86],"as":[87],"induced":[89,103],"subgraph":[90],"\ud835\udca2":[92,114,158],"class":[96],"all":[98,120,127],"generated":[100],"from":[101],"subgraphs":[104],"by":[107],"using":[108],"recursively.":[112],"Then":[113],"is":[116],"hole-free,":[118],"P":[121],"4":[122],"-free":[123],"graphs,":[124,129],"complement":[125],"bipartite":[128],"some":[131],"imperfect":[132],"graphs.":[133],"MWIS":[138],"clique":[142,149],"(MWC)":[143],"MC":[145],"cover":[150],"(MCC)":[151],"can":[153],"solved":[155],"efficiently":[156],".":[160]},"counts_by_year":[],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}