{"id":"https://openalex.org/W2016317523","doi":"https://doi.org/10.1016/0020-0190(95)00128-y","title":"Parallel algorithms for connectivity problems on interval graphs","display_name":"Parallel algorithms for connectivity problems on interval graphs","publication_year":1995,"publication_date":"1995-10-01","ids":{"openalex":"https://openalex.org/W2016317523","doi":"https://doi.org/10.1016/0020-0190(95)00128-y","mag":"2016317523"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(95)00128-y","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(95)00128-y","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5101785418","display_name":"Sanjeev Saxena","orcid":"https://orcid.org/0000-0002-9581-1732"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Sanjeev Saxena","raw_affiliation_strings":["Computer Science and Engineering, Indian Institute of Technology, Kanpur 208 016, India","Computer Science and Engineering, Indian Institute of Technology, Kanpur, 208 016, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, Indian Institute of Technology, Kanpur 208 016, India","institution_ids":["https://openalex.org/I94234084"]},{"raw_affiliation_string":"Computer Science and Engineering, Indian Institute of Technology, Kanpur, 208 016, India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040946106","display_name":"Narein Rao","orcid":"https://orcid.org/0009-0005-0495-3671"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"N.Malahal Rao","raw_affiliation_strings":["Computer Science and Engineering, Indian Institute of Technology, Kanpur 208 016, India","Computer Science and Engineering, Indian Institute of Technology, Kanpur, 208 016, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, Indian Institute of Technology, Kanpur 208 016, India","institution_ids":["https://openalex.org/I94234084"]},{"raw_affiliation_string":"Computer Science and Engineering, Indian Institute of Technology, Kanpur, 208 016, India","institution_ids":["https://openalex.org/I94234084"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101785418"],"corresponding_institution_ids":["https://openalex.org/I94234084"],"apc_list":{"value":2040,"currency":"USD","value_usd":2040},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.1468486,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"56","issue":"1","first_page":"37","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T12072","display_name":"Machine Learning and Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9980999827384949,"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/interval","display_name":"Interval (graph theory)","score":0.6383745670318604},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.6143944263458252},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.548459529876709},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5277077555656433},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5253804922103882},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5082178115844727},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5061370730400085},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48616430163383484},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4504677355289459},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4495391845703125},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4186704754829407},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40306174755096436},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.17160552740097046},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09847363829612732}],"concepts":[{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.6383745670318604},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.6143944263458252},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.548459529876709},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5277077555656433},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5253804922103882},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5082178115844727},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5061370730400085},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48616430163383484},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4504677355289459},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4495391845703125},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4186704754829407},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40306174755096436},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.17160552740097046},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09847363829612732}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(95)00128-y","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(95)00128-y","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W70534610","https://openalex.org/W71663690","https://openalex.org/W1560616275","https://openalex.org/W1925157212","https://openalex.org/W1964193563","https://openalex.org/W1978195871","https://openalex.org/W1978560871","https://openalex.org/W2041917123","https://openalex.org/W2048724082","https://openalex.org/W2076885419","https://openalex.org/W2078960854","https://openalex.org/W2109560070","https://openalex.org/W2143474538","https://openalex.org/W2159008239","https://openalex.org/W2320198223","https://openalex.org/W2799004609","https://openalex.org/W6602914323","https://openalex.org/W6640251600","https://openalex.org/W6645058603"],"related_works":["https://openalex.org/W2078832298","https://openalex.org/W4294541002","https://openalex.org/W2398738602","https://openalex.org/W4377371889","https://openalex.org/W2170790524","https://openalex.org/W2965171438","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W2002128741"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}