{"id":"https://openalex.org/W2073015256","doi":"https://doi.org/10.1080/00207169908804777","title":"An efficient algorithm to generate all maximal independent sets on trapezoid graphs","display_name":"An efficient algorithm to generate all maximal independent sets on trapezoid graphs","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2073015256","doi":"https://doi.org/10.1080/00207169908804777","mag":"2073015256"},"language":"en","primary_location":{"id":"doi:10.1080/00207169908804777","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169908804777","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":null,"display_name":"Marinmoy Hota","orcid":null},"institutions":[{"id":"https://openalex.org/I41549804","display_name":"Vidyasagar University","ror":"https://ror.org/027jsza11","country_code":"IN","type":"education","lineage":["https://openalex.org/I41549804"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Marinmoy Hota","raw_affiliation_strings":["Department of Applied Mathematics with Oceanology and Computer Programming , Vidyasagar University , Midnapore, 721 102, India","Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore 721-102, India"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics with Oceanology and Computer Programming , Vidyasagar University , Midnapore, 721 102, India","institution_ids":["https://openalex.org/I41549804"]},{"raw_affiliation_string":"Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore 721-102, India","institution_ids":["https://openalex.org/I41549804"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039205000","display_name":"Madhumangal Pal","orcid":"https://orcid.org/0000-0002-6709-836X"},"institutions":[{"id":"https://openalex.org/I251397004","display_name":"Midnapore Medical College and Hospital","ror":"https://ror.org/03p37kd86","country_code":"IN","type":"education","lineage":["https://openalex.org/I251397004"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Madhumangal Pal","raw_affiliation_strings":["Department of Mathematics , Midnapore College , Midnapore, 721 101, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics , Midnapore College , Midnapore, 721 101, India","institution_ids":["https://openalex.org/I251397004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029384299","display_name":"Tapan K. Pal","orcid":"https://orcid.org/0000-0003-4007-9879"},"institutions":[{"id":"https://openalex.org/I41549804","display_name":"Vidyasagar University","ror":"https://ror.org/027jsza11","country_code":"IN","type":"education","lineage":["https://openalex.org/I41549804"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Tapan K. Pal","raw_affiliation_strings":["Department of Applied Mathematics with Oceanology and Computer Programming , Vidyasagar University , Midnapore, 721 102, India","Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore 721-102, India"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics with Oceanology and Computer Programming , Vidyasagar University , Midnapore, 721 102, India","institution_ids":["https://openalex.org/I41549804"]},{"raw_affiliation_string":"Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore 721-102, India","institution_ids":["https://openalex.org/I41549804"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I41549804"],"apc_list":null,"apc_paid":null,"fwci":0.977,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.76588176,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"70","issue":"4","first_page":"587","last_page":"599"},"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9977999925613403,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/mathematics","display_name":"Mathematics","score":0.7476472854614258},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.6398980021476746},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5790854692459106},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5500624179840088},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49108386039733887},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4646785855293274},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4459034502506256},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.41703033447265625},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.41022390127182007},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3653299808502197}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7476472854614258},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.6398980021476746},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5790854692459106},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5500624179840088},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49108386039733887},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4646785855293274},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4459034502506256},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.41703033447265625},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.41022390127182007},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3653299808502197}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207169908804777","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169908804777","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W139565880","https://openalex.org/W1531013282","https://openalex.org/W1541948205","https://openalex.org/W1968285535","https://openalex.org/W1972965975","https://openalex.org/W1990418828","https://openalex.org/W2010733068","https://openalex.org/W2054748563","https://openalex.org/W2056944493","https://openalex.org/W2062420832","https://openalex.org/W2068025855","https://openalex.org/W2072122885","https://openalex.org/W2076261965","https://openalex.org/W2077583413","https://openalex.org/W2089417393","https://openalex.org/W2111523610","https://openalex.org/W2124526408","https://openalex.org/W2125837271","https://openalex.org/W2143474538","https://openalex.org/W2320198223","https://openalex.org/W4389781963"],"related_works":["https://openalex.org/W2031276298","https://openalex.org/W1491760138","https://openalex.org/W2898526288","https://openalex.org/W2607123191","https://openalex.org/W205406847","https://openalex.org/W2362011785","https://openalex.org/W1892973443","https://openalex.org/W3130332934","https://openalex.org/W2949755351","https://openalex.org/W2061237693"],"abstract_inverted_index":{"Generation":[0],"of":[1,22,52,54,58,65,80],"all":[2,34,82],"maximal":[3,35,67],"independent":[4,36,68],"sets":[5,37],"(MIS)":[6],"is":[7,28,71],"a":[8,18,39,47],"NP-complete":[9],"problem":[10,79],"for":[11,38,84],"general":[12],"graphs.":[13,86],"In":[14],"this":[15,78],"paper,":[16],"using":[17],"particular":[19],"geometric":[20],"property":[21],"trapezoid":[23,40,85],"graph,":[24],"an":[25],"efficient":[26],"algorithm":[27,74],"designed":[29],"which":[30],"enables":[31],"to":[32,76],"generate":[33],"graph":[41,57,61],"in":[42],"time,":[43],"where":[44],"[mbar]":[45],"and":[46,62],"are":[48],"respectively":[49],"the":[50,55,59,63],"number":[51,64],"edges":[53],"complement":[56],"given":[60],"generated":[66],"sets.":[69],"There":[70],"no":[72],"prior":[73],"available":[75],"solve":[77],"finding":[81],"MIS":[83]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":11}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}