{"id":"https://openalex.org/W3039967246","doi":"https://doi.org/10.1145/3350755.3400259","title":"Parallel Planar Subgraph Isomorphism and Vertex Connectivity","display_name":"Parallel Planar Subgraph Isomorphism and Vertex Connectivity","publication_year":2020,"publication_date":"2020-07-06","ids":{"openalex":"https://openalex.org/W3039967246","doi":"https://doi.org/10.1145/3350755.3400259","mag":"3039967246"},"language":"en","primary_location":{"id":"doi:10.1145/3350755.3400259","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3350755.3400259","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2007.01199","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052014295","display_name":"Lukas Gianinazzi","orcid":"https://orcid.org/0000-0001-5975-4526"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Lukas Gianinazzi","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland","ETH Z\u00fcrich"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"ETH Z\u00fcrich","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026990786","display_name":"Torsten Hoefler","orcid":"https://orcid.org/0000-0002-1333-9797"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Torsten Hoefler","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland","ETH Z\u00fcrich"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"ETH Z\u00fcrich","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052014295"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.106893,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"269","last_page":"280"},"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.9994999766349792,"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.9994999766349792,"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.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/T12292","display_name":"Graph Theory and Algorithms","score":0.9987000226974487,"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/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.7466579675674438},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7270498275756836},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.690534234046936},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6858130097389221},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6803563833236694},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5938027501106262},{"id":"https://openalex.org/keywords/book-embedding","display_name":"Book embedding","score":0.567969799041748},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5558270215988159},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.5329640507698059},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.512045681476593},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4804365336894989},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4799402356147766},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4228883981704712},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4113064408302307},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.35975396633148193},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.27183008193969727},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.25872689485549927}],"concepts":[{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.7466579675674438},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7270498275756836},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.690534234046936},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6858130097389221},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6803563833236694},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5938027501106262},{"id":"https://openalex.org/C180222743","wikidata":"https://www.wikidata.org/wiki/Q4942980","display_name":"Book embedding","level":5,"score":0.567969799041748},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5558270215988159},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.5329640507698059},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.512045681476593},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4804365336894989},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4799402356147766},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4228883981704712},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4113064408302307},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.35975396633148193},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27183008193969727},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.25872689485549927},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3350755.3400259","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3350755.3400259","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2007.01199","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2007.01199","pdf_url":"https://arxiv.org/pdf/2007.01199","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":"","raw_type":null},{"id":"doi:10.48550/arxiv.2007.01199","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2007.01199","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"mag:3039967246","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2007.01199","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2007.01199","pdf_url":"https://arxiv.org/pdf/2007.01199","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":"","raw_type":null},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3039967246.pdf","grobid_xml":"https://content.openalex.org/works/W3039967246.grobid-xml"},"referenced_works_count":56,"referenced_works":["https://openalex.org/W272982077","https://openalex.org/W1491169489","https://openalex.org/W1512232443","https://openalex.org/W1513312763","https://openalex.org/W1513982482","https://openalex.org/W1541012495","https://openalex.org/W1567562836","https://openalex.org/W1836127928","https://openalex.org/W1967816223","https://openalex.org/W1974807151","https://openalex.org/W1981681460","https://openalex.org/W1987776185","https://openalex.org/W1995040285","https://openalex.org/W2010600799","https://openalex.org/W2013444956","https://openalex.org/W2024291212","https://openalex.org/W2030087828","https://openalex.org/W2038643780","https://openalex.org/W2044112344","https://openalex.org/W2055245094","https://openalex.org/W2057826895","https://openalex.org/W2058162908","https://openalex.org/W2060515419","https://openalex.org/W2067431706","https://openalex.org/W2094140918","https://openalex.org/W2098281668","https://openalex.org/W2099544822","https://openalex.org/W2111977969","https://openalex.org/W2114769758","https://openalex.org/W2125058377","https://openalex.org/W2126359798","https://openalex.org/W2128626931","https://openalex.org/W2134152592","https://openalex.org/W2135674162","https://openalex.org/W2135711152","https://openalex.org/W2136593687","https://openalex.org/W2148686552","https://openalex.org/W2148762636","https://openalex.org/W2153624566","https://openalex.org/W2156760067","https://openalex.org/W2165926628","https://openalex.org/W2224152264","https://openalex.org/W2436525433","https://openalex.org/W2611219145","https://openalex.org/W2861707247","https://openalex.org/W2913688336","https://openalex.org/W2945031003","https://openalex.org/W2962856411","https://openalex.org/W2962968573","https://openalex.org/W2963654823","https://openalex.org/W2964010100","https://openalex.org/W2980511539","https://openalex.org/W4292230561","https://openalex.org/W6645323698","https://openalex.org/W6665084082","https://openalex.org/W6665684704"],"related_works":["https://openalex.org/W2092904196","https://openalex.org/W1859417806","https://openalex.org/W1480720049","https://openalex.org/W1747997560","https://openalex.org/W1495378593","https://openalex.org/W1593753809","https://openalex.org/W2077772110","https://openalex.org/W2247177778","https://openalex.org/W2804631421","https://openalex.org/W1592641396","https://openalex.org/W3102007657","https://openalex.org/W1590991129","https://openalex.org/W2275468787","https://openalex.org/W1579180406","https://openalex.org/W1490378150","https://openalex.org/W1875294378","https://openalex.org/W2751975630","https://openalex.org/W569473531","https://openalex.org/W1518536587","https://openalex.org/W2249868860"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,36,39,50,54,74],"first":[3],"parallel":[4],"fixed-parameter":[5],"algorithm":[6,29,71],"for":[7,56,106],"subgraph":[8,69],"isomorphism":[9,70],"in":[10,84,101],"planar":[11,79,102,112],"graphs,":[12,14],"bounded-genus":[13],"and,":[15],"more":[16],"generally,":[17],"all":[18],"minor-closed":[19],"graphs":[20,103],"of":[21,38,77],"locally":[22],"bounded":[23],"treewidth.":[24],"Our":[25],"randomized":[26],"low":[27,43],"depth":[28,44,97],"has":[30],"a":[31,62,78],"near-linear":[32,86],"work":[33,51,87,94],"dependency":[34],"on":[35],"size":[37],"target":[40],"graph.":[41],"Existing":[42],"algorithms":[45],"do":[46],"not":[47],"guarantee":[48],"that":[49],"remains":[52],"asymptotically":[53,85],"same":[55],"any":[57],"constant-sized":[58],"pattern.":[59],"By":[60],"using":[61],"connection":[63],"to":[64],"certain":[65],"separating":[66],"cycles,":[67],"our":[68],"can":[72],"decide":[73],"vertex":[75],"connectivity":[76],"graph":[80],"(with":[81],"high":[82],"probability)":[83],"and":[88,95,110],"poly-logarithmic":[89,96],"depth.":[90],"Previously,":[91],"no":[92],"sub-quadratic":[93],"bound":[98],"was":[99],"known":[100],"(in":[104],"particular":[105],"distinguishing":[107],"between":[108],"four-connected":[109],"five-connected":[111],"graphs).":[113]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}