{"id":"https://openalex.org/W2066480089","doi":"https://doi.org/10.1142/s0129054193000122","title":"PARALLEL ALGORITHMS FOR FINDING MAXIMAL k-DEPENDENT SETS AND MAXIMAL f-MATCHINGS","display_name":"PARALLEL ALGORITHMS FOR FINDING MAXIMAL k-DEPENDENT SETS AND MAXIMAL f-MATCHINGS","publication_year":1993,"publication_date":"1993-06-01","ids":{"openalex":"https://openalex.org/W2066480089","doi":"https://doi.org/10.1142/s0129054193000122","mag":"2066480089"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054193000122","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054193000122","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5110053990","display_name":"Krzysztof Diks","orcid":null},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"KRZYSZTOF DIKS","raw_affiliation_strings":["Institute of Informatics, Warsaw University, ul. Banacha 2 02\u2013097 Warsaw, Poland","Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097 Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, Warsaw University, ul. Banacha 2 02\u2013097 Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097 Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000690869","display_name":"Oscar Garrido","orcid":null},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"OSCAR GARRIDO","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118 S-221 00 Lund, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118 S-221 00 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016509031","display_name":"Andrzej Lingas","orcid":"https://orcid.org/0000-0003-4998-9844"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"ANDRZEJ LINGAS","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118 S-221 00 Lund, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118 S-221 00 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9208,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.87183666,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"04","issue":"02","first_page":"179","last_page":"192"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9902999997138977,"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/T12288","display_name":"Optimization and Search Problems","score":0.9902999997138977,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9858999848365784,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9848999977111816,"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/combinatorics","display_name":"Combinatorics","score":0.7670270204544067},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5936879515647888},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5689159035682678},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5339136719703674},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.533818244934082},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4529116153717041},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.42945975065231323},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40893033146858215},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3772164285182953}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7670270204544067},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5936879515647888},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5689159035682678},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5339136719703674},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.533818244934082},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4529116153717041},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.42945975065231323},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40893033146858215},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3772164285182953},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054193000122","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054193000122","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.30.627","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.627","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.lth.se/Research/Algorithms/Papers/garrido2.ps","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":0,"referenced_works":[],"related_works":["https://openalex.org/W3013085049","https://openalex.org/W1560496689","https://openalex.org/W4386900933","https://openalex.org/W4385301946","https://openalex.org/W4297797135","https://openalex.org/W3125672081","https://openalex.org/W1673581201","https://openalex.org/W2991991550","https://openalex.org/W4289799755","https://openalex.org/W2089439745"],"abstract_inverted_index":{"Let":[0,117],"k":[1,31],"be":[2,90,119,148],"a":[3,6,15,37,42,47,79,95,100,120,132,171,175,207],"positive":[4,121],"integer,":[5],"subset":[7,136],"Q":[8,26],"of":[9,12,14,25,74,77,102,129,131,138,141,143,200],"the":[10,72,75,84,126,139,165,183],"set":[11,45,82,98,127,140],"vertices":[13,130],"graph":[16,48,101,133,176],"G":[17,21,144],"is":[18,145,155],"k-dependent":[19,44,81,97],"in":[20,33,46,52,83,99,105,186,210],"if":[22,151],"each":[23],"vertex":[24,153],"has":[27],"no":[28],"more":[29],"than":[30],"neighbours":[32],"Q.":[34],"We":[35,163],"present":[36,164],"parallel":[38],"algorithm":[39,88,168,184],"which":[40],"computes":[41],"maximal":[43,80,96,172,208],"on":[49,58,125,177,216],"n":[50,178],"nodes":[51,179],"time":[53,106,187,215],"O(":[54,107,188,211],"log":[55,108,189,212],"4":[56,190],"n)":[57,110,191,214],"an":[59,149,217],"EREW":[60,114,195,218],"PRAM":[61,115,196,219],"with":[62,220],"O(n":[63],"2":[64],")":[65],"processors.":[66,116,197,222],"In":[67],"this":[68],"way,":[69],"we":[70,204],"establish":[71],"membership":[73],"problem":[76],"constructing":[78,170],"class":[85],"NC.":[86],"Our":[87],"can":[89,205],"easily":[91],"adapted":[92],"to":[93,147,157],"compute":[94],"bounded":[103,202],"valence":[104],"*":[109,213],"using":[111],"only":[112],"O(n)":[113,221],"f":[118],"integer":[122],"function":[123],"defined":[124],"V":[128],"G.":[134],"A":[135],"F":[137],"edges":[142,161,182],"said":[146],"f-matching":[150,209],"every":[152],"v\u025bV":[154],"adjacent":[156],"at":[158],"most":[159],"f(v)":[160],"in-F.":[162],"first":[166],"NC":[167],"for":[169],"f-matching.":[173],"For":[174,198],"and":[180,192],"m":[181],"runs":[185],"uses":[193],"O(n+m)":[194],"graphs":[199],"constantly":[201],"valence,":[203],"construct":[206]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}