{"id":"https://openalex.org/W2065686230","doi":"https://doi.org/10.1007/s00224-002-1004-3","title":"An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs","display_name":"An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs","publication_year":2003,"publication_date":"2003-01-20","ids":{"openalex":"https://openalex.org/W2065686230","doi":"https://doi.org/10.1007/s00224-002-1004-3","mag":"2065686230"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-002-1004-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-002-1004-3","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","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, madhumangal@lycos.com, Midnapore-721 102, India, IN","Department of Applied Mathematics with Oceanology and Computer Programming,  Vidyasagar University, madhumangal@lycos.com"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics with Oceanology and Computer Programming,  Vidyasagar University, madhumangal@lycos.com, Midnapore-721 102, India, IN","institution_ids":["https://openalex.org/I41549804"]},{"raw_affiliation_string":"Department of Applied Mathematics with Oceanology and Computer Programming,  Vidyasagar University, madhumangal@lycos.com","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, madhumangal@lycos.com, Midnapore-721 102, India, IN","Department of Applied Mathematics with Oceanology and Computer Programming,  Vidyasagar University, madhumangal@lycos.com"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics with Oceanology and Computer Programming,  Vidyasagar University, madhumangal@lycos.com, Midnapore-721 102, India, IN","institution_ids":["https://openalex.org/I41549804"]},{"raw_affiliation_string":"Department of Applied Mathematics with Oceanology and Computer Programming,  Vidyasagar University, madhumangal@lycos.com","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 K. Pal","raw_affiliation_strings":["Department of Applied Mathematics with Oceanology and Computer Programming,  Vidyasagar University, madhumangal@lycos.com, Midnapore-721 102, India, IN","Department of Applied Mathematics with Oceanology and Computer Programming,  Vidyasagar University, madhumangal@lycos.com"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics with Oceanology and Computer Programming,  Vidyasagar University, madhumangal@lycos.com, Midnapore-721 102, India, IN","institution_ids":["https://openalex.org/I41549804"]},{"raw_affiliation_string":"Department of Applied Mathematics with Oceanology and Computer Programming,  Vidyasagar University, madhumangal@lycos.com","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":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.4976,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.72838123,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"36","issue":"1","first_page":"17","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9972000122070312,"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/hinge","display_name":"Hinge","score":0.7566611170768738},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7288802266120911},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6869010925292969},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.604373574256897},{"id":"https://openalex.org/keywords/biconnected-graph","display_name":"Biconnected graph","score":0.5047389268875122},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.49114271998405457},{"id":"https://openalex.org/keywords/wheel-graph","display_name":"Wheel graph","score":0.49072062969207764},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4711538553237915},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4487364888191223},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44621142745018005},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44613391160964966},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.43171238899230957},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4307363033294678},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3382152318954468},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.21361464262008667},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1058112382888794},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08551204204559326},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.07972860336303711},{"id":"https://openalex.org/keywords/structural-engineering","display_name":"Structural engineering","score":0.06772005558013916}],"concepts":[{"id":"https://openalex.org/C44000306","wikidata":"https://www.wikidata.org/wiki/Q244330","display_name":"Hinge","level":2,"score":0.7566611170768738},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7288802266120911},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6869010925292969},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.604373574256897},{"id":"https://openalex.org/C45725084","wikidata":"https://www.wikidata.org/wiki/Q4390447","display_name":"Biconnected graph","level":5,"score":0.5047389268875122},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.49114271998405457},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.49072062969207764},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4711538553237915},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4487364888191223},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44621142745018005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44613391160964966},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.43171238899230957},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4307363033294678},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3382152318954468},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.21361464262008667},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1058112382888794},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08551204204559326},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.07972860336303711},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.06772005558013916},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00224-002-1004-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-002-1004-3","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","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":3,"referenced_works":["https://openalex.org/W2005122393","https://openalex.org/W2055472002","https://openalex.org/W2111321158"],"related_works":["https://openalex.org/W2064737922","https://openalex.org/W1970462054","https://openalex.org/W2982283786","https://openalex.org/W142613662","https://openalex.org/W1578001576","https://openalex.org/W1999569519","https://openalex.org/W2276107497","https://openalex.org/W4294959530","https://openalex.org/W2065686230","https://openalex.org/W2296996162"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}