{"id":"https://openalex.org/W2094822286","doi":"https://doi.org/10.1002/net.3230150106","title":"On digraphs with a rooted tree structure","display_name":"On digraphs with a rooted tree structure","publication_year":1985,"publication_date":"1985-03-01","ids":{"openalex":"https://openalex.org/W2094822286","doi":"https://doi.org/10.1002/net.3230150106","mag":"2094822286"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230150106","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230150106","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"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":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11422/1515","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004984970","display_name":"Jayme L. Szwarcfiter","orcid":"https://orcid.org/0000-0002-7538-7305"},"institutions":[{"id":"https://openalex.org/I122140584","display_name":"Universidade Federal do Rio de Janeiro","ror":"https://ror.org/03490as77","country_code":"BR","type":"education","lineage":["https://openalex.org/I122140584"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Jayme L. Szwarcfiter","raw_affiliation_strings":["Universidade Federal do Rio de Janeiro, Nu\u0301cleo de Computac\u0327a\u0303o Eletro\u030cnica, Caixa Postal 2324, Rio de Janeiro, RJ, 20001, Brasil","Universidade Federal do Rio de Janeiro, N\u00facleo de Computa\u00e7\u00e3o Eletr\u01d2nica, Caixa Postal 2324, Rio de Janeiro, RJ, 20001, Brasil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidade Federal do Rio de Janeiro, Nu\u0301cleo de Computac\u0327a\u0303o Eletro\u030cnica, Caixa Postal 2324, Rio de Janeiro, RJ, 20001, Brasil","institution_ids":["https://openalex.org/I122140584"]},{"raw_affiliation_string":"Universidade Federal do Rio de Janeiro, N\u00facleo de Computa\u00e7\u00e3o Eletr\u01d2nica, Caixa Postal 2324, Rio de Janeiro, RJ, 20001, Brasil","institution_ids":["https://openalex.org/I122140584"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004984970"],"corresponding_institution_ids":["https://openalex.org/I122140584"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.19252669,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"15","issue":"1","first_page":"49","last_page":"57"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.998199999332428,"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/T11106","display_name":"Data Management and Algorithms","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/isomorphism","display_name":"Isomorphism (crystallography)","score":0.7993789911270142},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6967349052429199},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.6965254545211792},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6347619891166687},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6303830146789551},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6166078448295593},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.5709204077720642},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.5573164224624634},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5263857841491699},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5114166140556335},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.5097829699516296},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4764454960823059},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4505385756492615},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.4342935383319855},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2450733780860901},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24428096413612366},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.15862274169921875},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10894918441772461},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0893082320690155}],"concepts":[{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.7993789911270142},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6967349052429199},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.6965254545211792},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6347619891166687},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6303830146789551},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6166078448295593},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.5709204077720642},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.5573164224624634},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5263857841491699},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5114166140556335},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.5097829699516296},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4764454960823059},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4505385756492615},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4342935383319855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2450733780860901},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24428096413612366},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.15862274169921875},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10894918441772461},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0893082320690155},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1002/net.3230150106","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230150106","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"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":"Networks","raw_type":"journal-article"},{"id":"pmh:oai:pantheon.ufrj.br:11422/1515","is_oa":true,"landing_page_url":"http://hdl.handle.net/11422/1515","pdf_url":"http://hdl.handle.net/11422/1515","source":{"id":"https://openalex.org/S4306402641","display_name":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Cient\u00edficas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4383465926","host_organization_name":"LA Referencia","host_organization_lineage":["https://openalex.org/I4383465926"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"instacron:UFRJ","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:oai:americanae.aecid.es:2574995","is_oa":true,"landing_page_url":"http://americanae.aecid.es/americanae/es/registros/registro.do?tipoRegistro=MTD&idBib=2574995","pdf_url":null,"source":{"id":"https://openalex.org/S4306400786","display_name":"Americanae (AECID Library)","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"reponame:Reposit\u00f3rio Institucional da UFRJ","raw_type":"info:eu-repo/semantics/report"}],"best_oa_location":{"id":"pmh:oai:pantheon.ufrj.br:11422/1515","is_oa":true,"landing_page_url":"http://hdl.handle.net/11422/1515","pdf_url":"http://hdl.handle.net/11422/1515","source":{"id":"https://openalex.org/S4306402641","display_name":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Cient\u00edficas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4383465926","host_organization_name":"LA Referencia","host_organization_lineage":["https://openalex.org/I4383465926"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"instacron:UFRJ","raw_type":"info:eu-repo/semantics/report"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2094822286.pdf"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W83921509","https://openalex.org/W1502293651","https://openalex.org/W1655990431","https://openalex.org/W1969065140","https://openalex.org/W1995246641","https://openalex.org/W1995405030","https://openalex.org/W2011039300","https://openalex.org/W2023541076","https://openalex.org/W2108471507","https://openalex.org/W2146441023"],"related_works":["https://openalex.org/W1482551403","https://openalex.org/W84561889","https://openalex.org/W1258892498","https://openalex.org/W2954463587","https://openalex.org/W2018568077","https://openalex.org/W2086198191","https://openalex.org/W1856194915","https://openalex.org/W3080158623","https://openalex.org/W2183579781","https://openalex.org/W2046021036"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"special":[2,79],"class":[3],"of":[4,13,30,38,51,57,71,81,83],"reducible":[5],"digraphs":[6,37],"is":[7,17,44,60,75],"characterized,":[8],"those":[9],"whose":[10],"transitive":[11],"reduction":[12],"the":[14,28,48,58,65],"associated":[15],"dag":[16],"a":[18,78],"directed":[19],"rooted":[20],"tree.":[21],"Polynomial":[22],"time":[23],"algorithms":[24],"are":[25],"described":[26],"for":[27,47],"problems":[29],"recognition,":[31],"isomorphism":[32,70,82],"and":[33],"finding":[34],"minimum":[35],"equivalent":[36],"this":[39,52,84],"class.":[40,85],"An":[41],"approximative":[42],"algorithm":[43],"also":[45],"given":[46],"general":[49],"case":[50,80],"last":[53],"problem.":[54],"The":[55],"size":[56],"approximation":[59],"always":[61],"less":[62],"than":[63],"twice":[64],"exact":[66],"solution.":[67],"In":[68],"addition,":[69],"depth":[72],"first":[73],"search":[74],"solved":[76],"as":[77]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}