{"id":"https://openalex.org/W2017704251","doi":"https://doi.org/10.1002/jgt.20544","title":"On the complexity of reconstructing H-free graphs from their Star Systems","display_name":"On the complexity of reconstructing H-free graphs from their Star Systems","publication_year":2010,"publication_date":"2010-10-26","ids":{"openalex":"https://openalex.org/W2017704251","doi":"https://doi.org/10.1002/jgt.20544","mag":"2017704251"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.20544","doi":"https://doi.org/10.1002/jgt.20544","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.20544","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"},"volume":null,"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/A5075328697","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612","observed_orcids":["https://orcid.org/0000-0003-1955-4612"]},"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":"Fedor V. Fomin","raw_affiliation_strings":["Department of Informatics, University of Bergen, N-5020 Bergen, Norway","DEPARTMENT OF INFORMATICS, UNIVERSITY OF BERGEN, N-5020 BERGEN, NORWAY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, N-5020 Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"DEPARTMENT OF INFORMATICS, UNIVERSITY OF BERGEN, N-5020 BERGEN, NORWAY","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066646775","display_name":"Jan Kratochv\u0131\u0301l","orcid":"https://orcid.org/0000-0002-2620-6133","observed_orcids":["https://orcid.org/0000-0002-2620-6133"]},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan Kratochv\u00edl","raw_affiliation_strings":["Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University Praha, Czech Republic","Department of Applied Mathematics, and Institute for Theoretical Computer Science, Charles University,Praha, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University Praha, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Department of Applied Mathematics, and Institute for Theoretical Computer Science, Charles University,Praha, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212","observed_orcids":["https://orcid.org/0000-0002-3166-9212"]},"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":"Daniel Lokshtanov","raw_affiliation_strings":["Department of Informatics, University of Bergen, N-5020 Bergen, Norway","DEPARTMENT OF INFORMATICS, UNIVERSITY OF BERGEN, N-5020 BERGEN, NORWAY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, N-5020 Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"DEPARTMENT OF INFORMATICS, UNIVERSITY OF BERGEN, N-5020 BERGEN, NORWAY","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036741322","display_name":"Federico Mancini","orcid":null,"observed_orcids":[]},"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":"Federico Mancini","raw_affiliation_strings":["Department of Informatics, University of Bergen, N-5020 Bergen, Norway","DEPARTMENT OF INFORMATICS, UNIVERSITY OF BERGEN, N-5020 BERGEN, NORWAY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, N-5020 Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"DEPARTMENT OF INFORMATICS, UNIVERSITY OF BERGEN, N-5020 BERGEN, NORWAY","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019858728","display_name":"Jan Arne Telle","orcid":"https://orcid.org/0000-0002-9429-5377","observed_orcids":["https://orcid.org/0000-0002-9429-5377"]},"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":"Jan Arne Telle","raw_affiliation_strings":["Department of Informatics, University of Bergen, N-5020 Bergen, Norway","DEPARTMENT OF INFORMATICS, UNIVERSITY OF BERGEN, N-5020 BERGEN, NORWAY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, N-5020 Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"DEPARTMENT OF INFORMATICS, UNIVERSITY OF BERGEN, N-5020 BERGEN, NORWAY","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":4150,"currency":"USD","value_usd":4150},"apc_paid":null,"fwci":0.9668,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.7577192,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":"68","issue":"2","first_page":"113","last_page":"124"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0005000000237487257,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.0,"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/h-free-graphs","display_name":"H-free graphs","score":0.9129999876022339},{"id":"https://openalex.org/keywords/closed-neighborhoods","display_name":"closed neighborhoods","score":0.7160000205039978},{"id":"https://openalex.org/keywords/graph-reconstruction","display_name":"graph reconstruction","score":0.6460000276565552},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.878000020980835},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.6600000262260437},{"id":"https://openalex.org/keywords/dichotomy","display_name":"dichotomy","score":0.7580000162124634},{"id":"https://openalex.org/keywords/forbidden-induced-subgraphs","display_name":"forbidden induced subgraphs","score":0.7139999866485596},{"id":"https://openalex.org/keywords/paths","display_name":"paths","score":0.7419999837875366},{"id":"https://openalex.org/keywords/cycles","display_name":"cycles","score":0.7490000128746033},{"id":"https://openalex.org/keywords/hypergraphs","display_name":"hypergraphs","score":0.8130000233650208}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8176532983779907},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7071616649627686},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5440428256988525},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.5432760119438171},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.5418785810470581},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.5230156779289246},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4892423152923584},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.45105352997779846},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.4418623447418213},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4408096373081207},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.39117833971977234},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.15803900361061096},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12077894806861877},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0},{"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/jgt.20544","doi":"https://doi.org/10.1002/jgt.20544","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.20544","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W95977715","https://openalex.org/W655258421","https://openalex.org/W1565016281","https://openalex.org/W2004402862","https://openalex.org/W2024530086","https://openalex.org/W2028775537","https://openalex.org/W2041176939","https://openalex.org/W2084665552","https://openalex.org/W2141553945","https://openalex.org/W4248711660","https://openalex.org/W4253538798"],"related_works":["https://openalex.org/W1496800439","https://openalex.org/W2013995268","https://openalex.org/W3147452171","https://openalex.org/W1930073757","https://openalex.org/W2022959563","https://openalex.org/W4297789824","https://openalex.org/W4283803822","https://openalex.org/W2950834709","https://openalex.org/W1969119072","https://openalex.org/W1544045550"],"abstract_inverted_index":{"In":[0,130,155],"the":[1,18,60,69,99,103,124,148,157],"Star":[2,62,70,105,150],"System":[3,63,71,106,151],"problem":[4,64,72,125,152,158],"we":[5,135],"are":[6],"given":[7,27,79],"a":[8,41,56,66,78,88,114,117,142,165,168,177],"set":[9,36,80],"system":[10,81],"and":[11,182],"asked":[12,76],"whether":[13,77],"it":[14,74],"is":[15,65,75,82,113,126,153,159,163],"realizable":[16,83],"by":[17,84],"multi-set":[19],"of":[20,23,33,68,87,102,146],"closed":[21,85],"neighborhoods":[22,86],"some":[24],"graph,":[25],"i.e.":[26],"subsets":[28],"S1,":[29],"S2,":[30,52],"\u2026,":[31,53],"Sn":[32],"an":[34,94],"n-element":[35],"V":[37],"does":[38],"there":[39],"exist":[40],"graph":[42,58,89],"G":[43],"=":[44,50],"(V,":[45],"E)":[46],"with":[47],"{N[v]:":[48],"v\u2208V}":[49],"{S1,":[51],"Sn}?":[54],"For":[55],"fixed":[57],"H":[59,92,112,139,162],"H-free":[61,104,149],"variant":[67],"where":[73],"containing":[90],"no":[91],"as":[93],"induced":[95],"subgraph.":[96],"We":[97,108],"study":[98],"computational":[100],"complexity":[101],"problem.":[107],"prove":[109],"that":[110,137],"when":[111,161],"path":[115,169],"or":[116,167],"cycle":[118,166],"on":[119,170],"at":[120,171],"most":[121],"four":[122],"vertices":[123],"polynomial":[127],"time":[128],"solvable.":[129],"complement":[131],"to":[132,141],"this":[133],"result,":[134],"show":[136],"if":[138],"belongs":[140],"certain":[143],"large":[144],"class":[145],"graphs":[147],"NP-complete.":[154],"particular,":[156],"NP-complete":[160],"either":[164],"least":[172],"five":[173],"vertices.":[174],"This":[175],"yields":[176],"complete":[178],"dichotomy":[179],"for":[180],"paths":[181],"cycles.":[183],"Copyright":[184],"\u00a9":[185],"2010":[186],"John":[187],"Wiley":[188],"&":[189],"Sons,":[190],"Ltd.":[191],"68:113-124,":[192],"2011":[193]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-10-01T08:54:57.152042","created_date":"2025-10-10T00:00:00"}