{"id":"https://openalex.org/W2024530086","doi":"https://doi.org/10.1017/s0963548300000535","title":"Reconstructing a Graph from its Neighborhood Lists","display_name":"Reconstructing a Graph from its Neighborhood Lists","publication_year":1993,"publication_date":"1993-06-01","ids":{"openalex":"https://openalex.org/W2024530086","doi":"https://doi.org/10.1017/s0963548300000535","mag":"2024530086"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548300000535","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548300000535","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":["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/A5012929183","display_name":"Martin Aigner","orcid":"https://orcid.org/0000-0003-4568-9836"},"institutions":[{"id":"https://openalex.org/I75951250","display_name":"Freie Universit\u00e4t Berlin","ror":"https://ror.org/046ak2485","country_code":"DE","type":"education","lineage":["https://openalex.org/I75951250"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Aigner","raw_affiliation_strings":["Freie Universit\u00e4t Berlin, Fachbereich Mathematik, WE 2, Arnimallee 3, 1000 Berlin 33, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Freie Universit\u00e4t Berlin, Fachbereich Mathematik, WE 2, Arnimallee 3, 1000 Berlin 33, Germany","institution_ids":["https://openalex.org/I75951250"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109963706","display_name":"Eberhard Triesch","orcid":null},"institutions":[{"id":"https://openalex.org/I4210166048","display_name":"Gesellschaft Fur Mathematik Und Datenverarbeitung","ror":"https://ror.org/02g6d4t03","country_code":"DE","type":"facility","lineage":["https://openalex.org/I4210166048"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Eberhard Triesch","raw_affiliation_strings":["Forschungsinsitut f\u00fcr Diskrete Mathematik, Nassestra\u00dfe 2, 5300 Bonn 1, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Forschungsinsitut f\u00fcr Diskrete Mathematik, Nassestra\u00dfe 2, 5300 Bonn 1, Germany","institution_ids":["https://openalex.org/I4210166048"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.517,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.63178207,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"2","issue":"2","first_page":"103","last_page":"113"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9951000213623047,"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/T11476","display_name":"Graph theory and applications","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/bipartite-graph","display_name":"Bipartite graph","score":0.8097480535507202},{"id":"https://openalex.org/keywords/multiset","display_name":"Multiset","score":0.7946003675460815},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.749125599861145},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.7456890940666199},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5779218077659607},{"id":"https://openalex.org/keywords/edge-transitive-graph","display_name":"Edge-transitive graph","score":0.5698891282081604},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.5589103698730469},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5061692595481873},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4914153814315796},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.4234219491481781},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.4147986173629761},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.36551129817962646},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.3161962628364563}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8097480535507202},{"id":"https://openalex.org/C2779623528","wikidata":"https://www.wikidata.org/wiki/Q864377","display_name":"Multiset","level":2,"score":0.7946003675460815},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.749125599861145},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.7456890940666199},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5779218077659607},{"id":"https://openalex.org/C200597783","wikidata":"https://www.wikidata.org/wiki/Q4391289","display_name":"Edge-transitive graph","level":5,"score":0.5698891282081604},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.5589103698730469},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5061692595481873},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4914153814315796},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.4234219491481781},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.4147986173629761},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.36551129817962646},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.3161962628364563},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548300000535","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548300000535","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2041176939","https://openalex.org/W2773462233"],"related_works":["https://openalex.org/W1482551403","https://openalex.org/W84561889","https://openalex.org/W2954463587","https://openalex.org/W2393701947","https://openalex.org/W1965191464","https://openalex.org/W2915540008","https://openalex.org/W1887488684","https://openalex.org/W2018568077","https://openalex.org/W167435155","https://openalex.org/W2128390795"],"abstract_inverted_index":{"Associate":[0],"to":[1,38,66,74],"a":[2,30,35],"finite":[3],"labeled":[4],"graph":[5],"G":[6,16,41,46,70,78,82,92],"(":[7,15,45,77,87,91],"V,":[8],"E":[9],")":[10,17,89],"its":[11],"multiset":[12],"of":[13,28],"neighborhoods":[14],"=":[18,90],"{N(\u03c5):":[19],"\u03c5":[20],"\u2208":[21],"V":[22],"}.":[23],"We":[24],"discuss":[25],"the":[26,52,60],"question":[27],"when":[29],"list":[31],"is":[32,42,55,63,83,96],"realizable":[33],"by":[34,44,76],"graph,":[36],"and":[37,80,86],"what":[39],"extent":[40],"determined":[43,72],").":[47],"The":[48],"main":[49],"results":[50],"are:":[51],"decision":[53,61],"problem":[54,62],"NP-complete;":[56],"for":[57],"bipartite":[58,85],"graphs":[59],"polynomially":[64],"equivalent":[65],"Graph":[67],"Isomorphism;":[68],"forests":[69],"are":[71],"up":[73],"isomorphism":[75],");":[79],"if":[81],"connected":[84],"H":[88,95],"),":[93],"then":[94],"completely":[97],"described.":[98]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}