{"id":"https://openalex.org/W1988081733","doi":"https://doi.org/10.1007/s004539910013","title":"Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems","display_name":"Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems","publication_year":2000,"publication_date":"2000-02-01","ids":{"openalex":"https://openalex.org/W1988081733","doi":"https://doi.org/10.1007/s004539910013","mag":"1988081733"},"language":"en","primary_location":{"id":"doi:10.1007/s004539910013","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004539910013","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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/A5006815178","display_name":"M. G. Andrews","orcid":null},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]},{"id":"https://openalex.org/I45536552","display_name":"North Central College","ror":"https://ror.org/02ehan050","country_code":"US","type":"education","lineage":["https://openalex.org/I45536552"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M. G. Andrews","raw_affiliation_strings":["AT&T Bell Laboratories, \t2000 N. Naperville Road, \tNaperville, IL 60566, \tUSA. m.g.andrews@att.com., , , , , , US","AT&T Bell Laboratories, 2000 N. Naperville Road, Naperville, IL 60566, USA. m.g.andrews@att.com., US"],"affiliations":[{"raw_affiliation_string":"AT&T Bell Laboratories, \t2000 N. Naperville Road, \tNaperville, IL 60566, \tUSA. m.g.andrews@att.com., , , , , , US","institution_ids":["https://openalex.org/I45536552"]},{"raw_affiliation_string":"AT&T Bell Laboratories, 2000 N. Naperville Road, Naperville, IL 60566, USA. m.g.andrews@att.com., US","institution_ids":["https://openalex.org/I72090969"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113562454","display_name":"Mikhail J. Atallah","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. J. Atallah","raw_affiliation_strings":["Department of Computer Sciences, \tPurdue University, \tWest Lafayette, IN 47907, \tUSA. mja@cs.purdue.edu., , , , , , US","Department of Computer Sciences, Purdue University, West Lafayette, IN 47907, USA. mja@cs.purdue.edu., US"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, \tPurdue University, \tWest Lafayette, IN 47907, \tUSA. mja@cs.purdue.edu., , , , , , US","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Department of Computer Sciences, Purdue University, West Lafayette, IN 47907, USA. mja@cs.purdue.edu., US","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081241418","display_name":"D. Z. Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Z. Chen","raw_affiliation_strings":["Department of Computer Science and Engineering, \tUniversity of Notre Dame, \tNotre Dame, IN 46556, \tUSA. chen@cse.nd.edu., , , , , , US","Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA. chen@cse.nd.edu., US"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, \tUniversity of Notre Dame, \tNotre Dame, IN 46556, \tUSA. chen@cse.nd.edu., , , , , , US","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA. chen@cse.nd.edu., US","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005922050","display_name":"D. T. Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I84653119","display_name":"Academia Sinica","ror":"https://ror.org/05bxb3784","country_code":"TW","type":"facility","lineage":["https://openalex.org/I84653119"]},{"id":"https://openalex.org/I4210098366","display_name":"Institute of Information Science, Academia Sinica","ror":"https://ror.org/00z83z196","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210098366","https://openalex.org/I84653119"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"D. T. Lee","raw_affiliation_strings":["Institute of Information Science,  Academia Sinica,  Nankang, Taiwan 11529. dtlee@iis.sinica.edu.tw., , , , , , TW","Institute of Information Science,  Academia Sinica,  Nankang, Taiwan 11529. dtlee@iis.sinica.edu.tw., , TW"],"affiliations":[{"raw_affiliation_string":"Institute of Information Science,  Academia Sinica,  Nankang, Taiwan 11529. dtlee@iis.sinica.edu.tw., , , , , , TW","institution_ids":["https://openalex.org/I4210098366"]},{"raw_affiliation_string":"Institute of Information Science,  Academia Sinica,  Nankang, Taiwan 11529. dtlee@iis.sinica.edu.tw., , TW","institution_ids":["https://openalex.org/I84653119"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5006815178"],"corresponding_institution_ids":["https://openalex.org/I45536552","https://openalex.org/I72090969"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.4053,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.80871492,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"26","issue":"2","first_page":"263","last_page":"289"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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.9941999912261963,"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.9815000295639038,"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/hypercube","display_name":"Hypercube","score":0.845599889755249},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7779468297958374},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.658615231513977},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6498792171478271},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6210165023803711},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6051607131958008},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6031708121299744},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5877265930175781},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.564808189868927},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5032998919487},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.49944353103637695},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4379291236400604},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.4301050305366516},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42276063561439514},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3579799234867096},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3536878228187561},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.19541558623313904},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07760217785835266}],"concepts":[{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.845599889755249},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7779468297958374},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.658615231513977},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6498792171478271},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6210165023803711},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6051607131958008},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6031708121299744},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5877265930175781},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.564808189868927},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5032998919487},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.49944353103637695},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4379291236400604},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.4301050305366516},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42276063561439514},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3579799234867096},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3536878228187561},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.19541558623313904},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07760217785835266},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s004539910013","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004539910013","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:docs.lib.purdue.edu:cstech-2420","is_oa":false,"landing_page_url":"https://docs.lib.purdue.edu/cstech/1421","pdf_url":null,"source":{"id":"https://openalex.org/S4377196310","display_name":"Purdue e-Pubs (Purdue University System)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801333002","host_organization_name":"Purdue University System","host_organization_lineage":["https://openalex.org/I2801333002"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science Technical Reports","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.158.7361","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.7361","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cerias.purdue.edu/ssl/techreports-ssl/2003-16.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W35758821","https://openalex.org/W73845553","https://openalex.org/W1513400187","https://openalex.org/W1581008104","https://openalex.org/W1965333879","https://openalex.org/W1984873461","https://openalex.org/W2007519459","https://openalex.org/W2008908074","https://openalex.org/W2028503265","https://openalex.org/W2038176627","https://openalex.org/W2043765170","https://openalex.org/W2062679636","https://openalex.org/W2067661972","https://openalex.org/W2082419751","https://openalex.org/W2097755092","https://openalex.org/W2100647352","https://openalex.org/W2108610799","https://openalex.org/W2110045923","https://openalex.org/W2120490947","https://openalex.org/W2130566259","https://openalex.org/W2134008688","https://openalex.org/W2143462372","https://openalex.org/W2143474538","https://openalex.org/W2742650223","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W2122343781","https://openalex.org/W2123417578","https://openalex.org/W2093369082","https://openalex.org/W2055625272","https://openalex.org/W2036758175","https://openalex.org/W1838063489","https://openalex.org/W1577155814","https://openalex.org/W2099271296","https://openalex.org/W2743938404","https://openalex.org/W2038796709"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}