{"id":"https://openalex.org/W7128715935","doi":"https://doi.org/10.48550/arxiv.2602.10948","title":"Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices","display_name":"Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices","publication_year":2026,"publication_date":"2026-02-11","ids":{"openalex":"https://openalex.org/W7128715935","doi":"https://doi.org/10.48550/arxiv.2602.10948"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.10948","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078621796","display_name":"Palash Dey","orcid":"https://orcid.org/0000-0003-0071-9464"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dey, Palash","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074556512","display_name":"Anubhav Dhar","orcid":"https://orcid.org/0000-0003-2483-757X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dhar, Anubhav","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125767445","display_name":"Ashlesha Hota","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hota, Ashlesha","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000594690","display_name":"Sudeshna Kolay","orcid":"https://orcid.org/0000-0002-2975-4856"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kolay, Sudeshna","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101651422","display_name":"Aritra Mitra","orcid":"https://orcid.org/0000-0002-0472-284X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mitra, Aritra","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.864799976348877,"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.864799976348877,"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.07760000228881836,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.015200000256299973,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8260999917984009},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7117000222206116},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6309999823570251},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6119999885559082},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5931000113487244},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.5012000203132629},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.43290001153945923},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4251999855041504},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.4041000008583069}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8260999917984009},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7641000151634216},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7117000222206116},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.694599986076355},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6309999823570251},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6119999885559082},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5931000113487244},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.5012000203132629},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4749000072479248},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.43290001153945923},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4251999855041504},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.4041000008583069},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39309999346733093},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.3889000117778778},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3853999972343445},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.3828999996185303},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.36329999566078186},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.3463999927043915},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.33009999990463257},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.2825999855995178},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.27570000290870667},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.26669999957084656},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.2644999921321869},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.25200000405311584},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.25189998745918274}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.10948","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.10948","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.10948","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.10948","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.7071912288665771}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,41],"this":[1,83,166],"paper,":[2],"we":[3,97],"study":[4,100],"the":[5,66,102,147,159],"Maximum":[6,68],"Common":[7,69],"Vertex":[8],"Subgraph":[9,70],"problem:":[10],"Given":[11],"two":[12],"input":[13,122],"graphs":[14],"$G_1,G_2$":[15],"and":[16,72,87,116,162],"a":[17,23,99,126,155],"non-negative":[18],"integer":[19],"$h$,":[20],"is":[21,35,85],"there":[22,34],"common":[24,105],"subgraph":[25],"$H$":[26,48],"on":[27,104],"at":[28,50],"least":[29,51],"$h$":[30],"vertices":[31],"such":[32],"that":[33,82],"no":[36],"isolated":[37],"vertex":[38,109],"in":[39,58,76],"$H$.":[40],"other":[42,63],"words,":[43],"each":[44],"connected":[45],"component":[46],"of":[47,65,101,118,129,144,165],"has":[49,74],"$2$":[52],"vertices.":[53],"This":[54,151],"problem":[55,71,84,103,134],"naturally":[56],"arises":[57],"graph":[59],"theory":[60],"along":[61],"with":[62,135,154],"variants":[64],"well-studied":[67],"also":[73],"applications":[75],"computational":[77],"social":[78],"choice.":[79],"We":[80,124],"show":[81],"NP-hard":[86],"provide":[88],"an":[89],"FPT":[90],"algorithm":[91],"when":[92],"parameterized":[93,130,163],"by":[94],"$h$.":[95],"Next,":[96],"conduct":[98],"structural":[106,149],"parameters":[107],"like":[108],"cover":[110],"number,":[111],"maximum":[112],"degree,":[113],"treedepth,":[114],"pathwidth":[115],"treewidth":[117],"one":[119],"or":[120],"both":[121],"graphs.":[123],"derive":[125],"complete":[127],"dichotomy":[128],"results":[131],"for":[132],"our":[133],"respect":[136],"to":[137],"individual":[138],"parameterizations":[139,145],"as":[140,142],"well":[141],"combinations":[143],"from":[146],"above":[148],"parameters.":[150],"provides":[152],"us":[153],"deep":[156],"insight":[157],"into":[158],"complexity":[160],"theoretic":[161],"landscape":[164],"problem.":[167]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-13T00:00:00"}