{"id":"https://openalex.org/W1974703933","doi":"https://doi.org/10.1080/00207160212707","title":"An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs","display_name":"An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1974703933","doi":"https://doi.org/10.1080/00207160212707","mag":"1974703933"},"language":"en","primary_location":{"id":"doi:10.1080/00207160212707","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160212707","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/A5054954732","display_name":"Debashis Bera","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":"Debashis Bera","raw_affiliation_strings":["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"]}]},{"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/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":"Madhumangal Pal","raw_affiliation_strings":["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"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103568922","display_name":"Tapan Kumar Pal","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":false,"raw_author_name":"Tapan Pal","raw_affiliation_strings":["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"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054954732"],"corresponding_institution_ids":["https://openalex.org/I41549804"],"apc_list":null,"apc_paid":null,"fwci":0.6775,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.66225231,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"79","issue":"10","first_page":"1057","last_page":"1065"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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.9997000098228455,"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/T11797","display_name":"graph theory and CDMA systems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7645224928855896},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6920697689056396},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5480024814605713},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.504207968711853},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.47831442952156067},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4658452272415161},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.4322672486305237},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3071441054344177}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7645224928855896},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6920697689056396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5480024814605713},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.504207968711853},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.47831442952156067},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4658452272415161},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.4322672486305237},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3071441054344177}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160212707","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160212707","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":11,"referenced_works":["https://openalex.org/W1531013282","https://openalex.org/W1541948205","https://openalex.org/W1968285535","https://openalex.org/W1972965975","https://openalex.org/W2010733068","https://openalex.org/W2024491681","https://openalex.org/W2054748563","https://openalex.org/W2072122885","https://openalex.org/W2073015256","https://openalex.org/W2143474538","https://openalex.org/W4299866835"],"related_works":["https://openalex.org/W2606892216","https://openalex.org/W2407258439","https://openalex.org/W2046928120","https://openalex.org/W2028363955","https://openalex.org/W4298570565","https://openalex.org/W2248185380","https://openalex.org/W2963157799","https://openalex.org/W2117608641","https://openalex.org/W2949755351","https://openalex.org/W4301695108"],"abstract_inverted_index":{"In":[0],"this":[1,35],"paper,":[2],"to":[3],"find":[4],"all":[5],"maximal":[6],"cliques":[7],"of":[8,14,24,48,50],"a":[9,12],"trapezoid":[10],"graph":[11,26,52],"set":[13],"intervals":[15],"have":[16],"been":[17],"constructed":[18],"by":[19],"projecting":[20],"the":[21,25,28,46,51,56],"geometrical":[22],"representation":[23],"on":[27],"bottom":[29],"line.":[30],"The":[31],"proposed":[32],"algorithm":[33],"for":[34],"purpose":[36],"takes":[37],"O(n":[38],"2":[39],"+":[40],"yn)":[41],"time,":[42],"where":[43],"n":[44],"is":[45,55],"number":[47],"vertices":[49],"and":[53],"y":[54],"output":[57],"size.":[58]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}