{"id":"https://openalex.org/W2899926070","doi":"https://doi.org/10.1017/s0963548320000127","title":"Finding independent transversals efficiently","display_name":"Finding independent transversals efficiently","publication_year":2020,"publication_date":"2020-05-14","ids":{"openalex":"https://openalex.org/W2899926070","doi":"https://doi.org/10.1017/s0963548320000127","mag":"2899926070"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548320000127","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548320000127","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1811.02687","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Alessandra Graf","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Alessandra Graf","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, N2L 3G1, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":null,"display_name":"Penny Haxell","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Penny Haxell","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, N2L 3G1, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":0.5826,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.71746604,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"29","issue":"5","first_page":"780","last_page":"806"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.6503000259399414,"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.6503000259399414,"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.2190999984741211,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.07559999823570251,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5593000054359436},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5482000112533569},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.45820000767707825},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.453000009059906},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.42179998755455017},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.36169999837875366},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.35359999537467957}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7053999900817871},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6096000075340271},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5593000054359436},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5482000112533569},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.45820000767707825},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.453000009059906},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45159998536109924},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.42179998755455017},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.36169999837875366},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.35359999537467957},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2955999970436096},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.28290000557899475},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.2775000035762787},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.2678000032901764},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.26350000500679016},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25839999318122864},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.25049999356269836}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0963548320000127","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548320000127","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1811.02687","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1811.02687","pdf_url":"https://arxiv.org/pdf/1811.02687","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1811.02687","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1811.02687","pdf_url":"https://arxiv.org/pdf/1811.02687","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W1507099897","https://openalex.org/W1558934860","https://openalex.org/W1578813712","https://openalex.org/W1965802316","https://openalex.org/W1966682191","https://openalex.org/W1986861105","https://openalex.org/W1993421845","https://openalex.org/W1993446652","https://openalex.org/W2001927417","https://openalex.org/W2006557844","https://openalex.org/W2008097118","https://openalex.org/W2011158566","https://openalex.org/W2013273488","https://openalex.org/W2016602690","https://openalex.org/W2019883273","https://openalex.org/W2022392080","https://openalex.org/W2031415330","https://openalex.org/W2042125214","https://openalex.org/W2043399762","https://openalex.org/W2047918966","https://openalex.org/W2050666090","https://openalex.org/W2066969286","https://openalex.org/W2067487847","https://openalex.org/W2069550402","https://openalex.org/W2085366727","https://openalex.org/W2087518343","https://openalex.org/W2093066443","https://openalex.org/W2093480133","https://openalex.org/W2096125244","https://openalex.org/W2096875564","https://openalex.org/W2109693504","https://openalex.org/W2119305988","https://openalex.org/W2121422768","https://openalex.org/W2123831997","https://openalex.org/W2128305992","https://openalex.org/W2146017177","https://openalex.org/W2156584294","https://openalex.org/W2198255326","https://openalex.org/W2405384989","https://openalex.org/W2773183959","https://openalex.org/W2785954841","https://openalex.org/W2899926070","https://openalex.org/W2949308130","https://openalex.org/W2962758870","https://openalex.org/W2963097814","https://openalex.org/W2963439943","https://openalex.org/W2977322974","https://openalex.org/W4231075269","https://openalex.org/W4241906804","https://openalex.org/W4245876577"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"We":[1],"give":[2,100],"an":[3,25],"efficient":[4],"algorithm":[5],"that,":[6],"given":[7],"a":[8,12,50,68,82,108],"graph":[9],"G":[10,39,62],"and":[11,86],"partition":[13],"V":[14,17],"1":[15,33],",\u2026,":[16,34],"m":[18,36],"of":[19,54,61,75,84,103,105,110],"its":[20],"vertex":[21,55],"set,":[22],"finds":[23],"either":[24],"independent":[26,29],"transversal":[27],"(an":[28],"set":[30],"{":[31],"v":[32,35],"}":[37],"in":[38],"such":[40,57],"that":[41,58],"${v_i}":[42],"\\in":[43],"{V_i}$":[44],"for":[45,81],"each":[46],"i":[47],"),":[48],"or":[49],"subset":[51],"${\\cal":[52],"B}$":[53,66],"classes":[56],"the":[59],"subgraph":[60],"induced":[63],"by":[64],"$\\bigcup\\nolimits_{\\cal":[65],"has":[67,78,87],"small":[69],"dominating":[70],"set.":[71],"A":[72],"non-algorithmic":[73],"proof":[74],"this":[76],"result":[77],"been":[79,88],"known":[80],"number":[83],"years":[85],"used":[89],"to":[90,99],"solve":[91],"many":[92,104],"other":[93],"problems.":[94],"Thus":[95],"we":[96,112],"are":[97],"able":[98],"algorithmic":[101],"versions":[102],"these":[106],"applications,":[107],"few":[109],"which":[111],"describe":[113],"explicitly":[114],"here.":[115]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-05-01T06:04:38.248271","created_date":"2018-11-16T00:00:00"}