{"id":"https://openalex.org/W3027222722","doi":"https://doi.org/10.1145/3313234","title":"Communication Complexity and Graph Families","display_name":"Communication Complexity and Graph Families","publication_year":2019,"publication_date":"2019-03-15","ids":{"openalex":"https://openalex.org/W3027222722","doi":"https://doi.org/10.1145/3313234","mag":"3027222722"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/3313234","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5000594690","display_name":"Sudeshna Kolay","orcid":"https://orcid.org/0000-0002-2975-4856"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Sudeshna Kolay","raw_affiliation_strings":["Eindhoven University of Technology, Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060986039","display_name":"Fahad Panolan","orcid":"https://orcid.org/0000-0001-6213-8687"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Fahad Panolan","raw_affiliation_strings":["University of Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015806060","display_name":"Saket Saurabh","orcid":"https://orcid.org/0000-0001-7847-6402"},"institutions":[{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_strings":["Institute of Mathematical Sciences, Chennai, India"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematical Sciences, Chennai, India","institution_ids":["https://openalex.org/I59611059"]}]}],"institution_assertions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":61},"biblio":{"volume":"11","issue":"2","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997,"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.9997,"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.9992,"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/T11567","display_name":"semigroups and automata theory","score":0.9913,"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/disjoint-sets","display_name":"Disjoint sets","score":0.5288533},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5286976}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.83620375},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6523474},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.62627774},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5288533},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5286976},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5281306},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.49636394},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45277742}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/3313234","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":27,"referenced_works":["https://openalex.org/W1983652976","https://openalex.org/W1990565272","https://openalex.org/W1996472240","https://openalex.org/W2001159171","https://openalex.org/W2002501531","https://openalex.org/W2006699094","https://openalex.org/W2013568176","https://openalex.org/W2036185209","https://openalex.org/W2045652876","https://openalex.org/W2053445839","https://openalex.org/W2059451253","https://openalex.org/W2061987651","https://openalex.org/W2080740807","https://openalex.org/W2084595628","https://openalex.org/W2113826940","https://openalex.org/W2166115470","https://openalex.org/W2214354563","https://openalex.org/W2220094226","https://openalex.org/W2240262109","https://openalex.org/W2340787257","https://openalex.org/W2398655357","https://openalex.org/W242849172","https://openalex.org/W2784736141","https://openalex.org/W2914414140","https://openalex.org/W2963309684","https://openalex.org/W4252114072","https://openalex.org/W605043455"],"related_works":["https://openalex.org/W90906771","https://openalex.org/W4298333731","https://openalex.org/W2529185025","https://openalex.org/W2490706771","https://openalex.org/W2147332298","https://openalex.org/W2051058708","https://openalex.org/W2018828772","https://openalex.org/W1983207144","https://openalex.org/W154868527","https://openalex.org/W1494268238"],"abstract_inverted_index":{"Given":[0,245],"a":[1,5,161,171,187,222,246,287,307,331,346,375],"graph":[2,15,91,105,172,247,264],"G":[3,20,33,36,39,43,49,60,65,144,173,183,198,208,214,230,238,248,272,342,356,365],"and":[4,35,48,54,68,112,235,364,394],"pair":[6,254],"(":[7,59,64,162,182,188,229,237,255,290,310,317,341,348],"F":[8,11,22,25,46,52,146,149,163,166,177,189,192,211,217,224,226,234,242,256,259,274,277,291,294,318,321,362,370],"1":[9,23,34,44,47,56,61,147,164,190,209,212,231,257,275,292,319,350,359,363],",":[10,21,24,40,145,148,165,191,199,213,219,258,273,276,279,293,320,351],"2":[12,26,37,50,53,66,150,167,193,215,218,239,260,278,295,308,322,353,368,371],")":[13,184,232,240,261,312,354],"of":[14,38,76,89,99,123,142,160,170,178,180,262,330,336,378],"families,":[16,383],"the":[17,73,80,96,103,121,139,328],"function":[18],"GDISJ":[19,143,271],"takes":[27],"as":[28,390,392],"input,":[29],"two":[30,104,125,203],"induced":[31,206],"subgraphs":[32,207],"such":[41,338],"that":[42,95,159,285,305,339],"\u2208":[45,51,210,216,225,361],"returns":[55],"if":[57,111,114,200],"V":[58,63,181,228,236,340,349,352,358,367],")\u2229":[62],")=\u2205":[67],"0":[69],"otherwise.":[70],"We":[71,93,373],"study":[72],"communication":[74,97,140,156,268],"complexity":[75,98,141,269],"this":[77,100],"problem":[78],"in":[79,120],"two-party":[81],"model.":[82],"In":[83,298],"particular,":[84],"we":[85,133,280,300],"look":[86],"at":[87],"pairs":[88],"hereditary":[90,263],"families.":[92,126],"show":[94],"function,":[101],"when":[102],"families":[106,265],"are":[107,116],"hereditary,":[108],"is":[109,158,185,221],"sublinear":[110,267],"only":[113],"there":[115,220],"finitely":[117],"many":[118],"graphs":[119],"intersection":[122],"these":[124,381],"Then,":[127],"using":[128],"concepts":[129],"from":[130],"parameterized":[131],"complexity,":[132],"obtain":[134,385],"nuanced":[135],"upper":[136],"bounds":[137],"on":[138,249],".":[151,174,372],"A":[152,175],"concept":[153],"related":[154],"to":[155,384],"protocols":[157],")-separating":[168,296,323],"family":[169,196],"collection":[176],"subsets":[179],"called":[186],")-":[194],"separating":[195,382],"for":[197,201,252,270,380,397],"any":[202,253],"vertex":[204],"disjoint":[205],"set":[223,334],"with":[227,266,355],"\u2286":[233],"\u2229":[241],"=":[243],"\u2205.":[244],"n":[250,313],"vertices,":[251],"give":[281,301],"an":[282,302],"enumeration":[283,303,388],"algorithm":[284,304],"finds":[286,306],"subexponential":[288],"sized":[289,316,333],"family.":[297],"fact,":[299],"o":[309],"k":[311,326],"O":[314],"(1)":[315],"family,":[324],"where":[325],"denotes":[327],"size":[329],"minimum":[332],"S":[335,344],"vertices":[337],")\\":[343],"has":[345],"bipartition":[347],"[":[357,366],"]":[360],"]\u2208":[369],"exhibit":[374],"wide":[376],"range":[377],"applications":[379],"combinatorial":[386],"bounds,":[387],"algorithms,":[389],"well":[391],"exact":[393],"FPT":[395],"algorithms":[396],"several":[398],"problems.":[399]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3027222722","counts_by_year":[],"updated_date":"2024-12-13T10:33:58.107913","created_date":"2020-05-29"}