{"id":"https://openalex.org/W1979190428","doi":"https://doi.org/10.1002/rsa.3240070304","title":"On the computational complexity of ordered subgraph recognition","display_name":"On the computational complexity of ordered subgraph recognition","publication_year":1995,"publication_date":"1995-10-01","ids":{"openalex":"https://openalex.org/W1979190428","doi":"https://doi.org/10.1002/rsa.3240070304","mag":"1979190428"},"language":"en","primary_location":{"id":"doi:10.1002/rsa.3240070304","is_oa":false,"landing_page_url":"https://doi.org/10.1002/rsa.3240070304","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"Random Structures & Algorithms","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/A5049969933","display_name":"Dwight Duffus","orcid":null},"institutions":[{"id":"https://openalex.org/I150468666","display_name":"Emory University","ror":"https://ror.org/03czfpz43","country_code":"US","type":"education","lineage":["https://openalex.org/I150468666"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dwight Duffus","raw_affiliation_strings":["Emory University, Atlanta, GA 30322","Emory University, Atlanta, Ga 30322"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Emory University, Atlanta, GA 30322","institution_ids":["https://openalex.org/I150468666"]},{"raw_affiliation_string":"Emory University, Atlanta, Ga 30322","institution_ids":["https://openalex.org/I150468666"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051487983","display_name":"Mark Ginn","orcid":null},"institutions":[{"id":"https://openalex.org/I150468666","display_name":"Emory University","ror":"https://ror.org/03czfpz43","country_code":"US","type":"education","lineage":["https://openalex.org/I150468666"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mark Ginn","raw_affiliation_strings":["Emory University, Atlanta, GA 30322","Emory University, Atlanta, Ga 30322"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Emory University, Atlanta, GA 30322","institution_ids":["https://openalex.org/I150468666"]},{"raw_affiliation_string":"Emory University, Atlanta, Ga 30322","institution_ids":["https://openalex.org/I150468666"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109078443","display_name":"Vojt\u011bch R\u00f6dl","orcid":null},"institutions":[{"id":"https://openalex.org/I150468666","display_name":"Emory University","ror":"https://ror.org/03czfpz43","country_code":"US","type":"education","lineage":["https://openalex.org/I150468666"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vojt\u011bch R\u00f6dl","raw_affiliation_strings":["Emory University, Atlanta, GA 30322","Emory University, Atlanta, Ga 30322"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Emory University, Atlanta, GA 30322","institution_ids":["https://openalex.org/I150468666"]},{"raw_affiliation_string":"Emory University, Atlanta, Ga 30322","institution_ids":["https://openalex.org/I150468666"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I150468666"],"apc_list":{"value":4330,"currency":"USD","value_usd":4330},"apc_paid":null,"fwci":0.5344,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.62247148,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"7","issue":"3","first_page":"223","last_page":"268"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9975000023841858,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"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/combinatorics","display_name":"Combinatorics","score":0.8014861345291138},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.6965823173522949},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.6787105202674866},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.639832079410553},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6165081858634949},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5839873552322388},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.5602279901504517},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.5565064549446106},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5413818359375},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4859272539615631},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.46927276253700256},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.45580175518989563},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.4524877369403839},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4471229016780853},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.42421072721481323},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.3191721737384796},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.25390976667404175},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.17262506484985352},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16697406768798828}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8014861345291138},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.6965823173522949},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.6787105202674866},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.639832079410553},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6165081858634949},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5839873552322388},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.5602279901504517},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.5565064549446106},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5413818359375},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4859272539615631},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.46927276253700256},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.45580175518989563},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.4524877369403839},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4471229016780853},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.42421072721481323},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.3191721737384796},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.25390976667404175},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.17262506484985352},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16697406768798828}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/rsa.3240070304","is_oa":false,"landing_page_url":"https://doi.org/10.1002/rsa.3240070304","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"Random Structures & Algorithms","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":28,"referenced_works":["https://openalex.org/W194364005","https://openalex.org/W1487872891","https://openalex.org/W1530753374","https://openalex.org/W1574303240","https://openalex.org/W1964678328","https://openalex.org/W1999552793","https://openalex.org/W2011039300","https://openalex.org/W2015769804","https://openalex.org/W2030087828","https://openalex.org/W2033520777","https://openalex.org/W2035331304","https://openalex.org/W2036265926","https://openalex.org/W2042706982","https://openalex.org/W2062069600","https://openalex.org/W2068871408","https://openalex.org/W2069367490","https://openalex.org/W2089465933","https://openalex.org/W2103012681","https://openalex.org/W2143474538","https://openalex.org/W2148043549","https://openalex.org/W2325204282","https://openalex.org/W2799004609","https://openalex.org/W4205141462","https://openalex.org/W4213214460","https://openalex.org/W4233413206","https://openalex.org/W4248209491","https://openalex.org/W4299866835","https://openalex.org/W6681707372"],"related_works":["https://openalex.org/W2393701947","https://openalex.org/W2953496651","https://openalex.org/W2886672068","https://openalex.org/W3208942821","https://openalex.org/W167435155","https://openalex.org/W1512756268","https://openalex.org/W4285101991","https://openalex.org/W4300773579","https://openalex.org/W4324266426","https://openalex.org/W2789630860"],"abstract_inverted_index":{"Abstract":[0],"Let":[1],"(":[2,24,58,79,88,96,115],"G":[3,10,25,59,80,89,97,110,116],",":[4,26,60,81,90,98,114,117],"<)":[5,61],"be":[6],"a":[7,12,39,44],"finite":[8],"graph":[9,35,55,72,108],"with":[11],"linearly":[13],"ordered":[14],"vertex":[15],"set":[16],"V":[17,49],".":[18],"We":[19,102],"consider":[20],"the":[21,76,93],"decision":[22],"problem":[23],"<)ORD":[27,99,118],"to":[28],"have":[29],"as":[30,38,75],"an":[31,33,52,63],"instance":[32],"(unordered)":[34],"\u0393":[36],"and":[37,51,134],"question":[40],"whether":[41],"there":[42],"exists":[43],"linear":[45],"order":[46,53],"\u2264":[47],"on":[48],"(\u0393)":[50],"preserving":[54],"isomorphism":[56],"of":[57,66,71,78,87,95],"onto":[62],"induced":[64],"subgraph":[65],"\u0393.":[67],"Several":[68,129],"familiar":[69],"classes":[70],"are":[73,132],"characterized":[74],"yes\u2010instances":[77],"<":[82],")ORD":[83],"for":[84,105,124],"appropriate":[85],"choices":[86],"<).":[91],"Here":[92],"complexity":[94],"is":[100,119,122],"investigated.":[101],"conjecture":[103],"that":[104],"any":[106],"2\u2010connected":[107,127],"G,":[109],"\u2260":[111],"K":[112],"k":[113],"NP\u2010complete.":[120],"This":[121],"verified":[123],"almost":[125],"all":[126],"graphs.":[128],"related":[130],"problems":[131],"formulated":[133],"discussed.":[135],"\u00a9":[136],"1995":[137],"John":[138],"Wiley":[139],"&":[140],"Sons,":[141],"Inc.":[142]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}