{"id":"https://openalex.org/W2126190768","doi":"https://doi.org/10.37236/1739","title":"Finding Induced Acyclic Subgraphs in Random Digraphs","display_name":"Finding Induced Acyclic Subgraphs in Random Digraphs","publication_year":2003,"publication_date":"2003-12-04","ids":{"openalex":"https://openalex.org/W2126190768","doi":"https://doi.org/10.37236/1739","mag":"2126190768"},"language":"en","primary_location":{"id":"doi:10.37236/1739","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1739","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v10i1r46/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v10i1r46/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061783801","display_name":"C. R. Subramanian","orcid":"https://orcid.org/0000-0001-8100-1133"},"institutions":[{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"C. R. Subramanian","raw_affiliation_strings":["The Institute of Mathematical Sciences Taramani, Chennai -600 113, India"],"affiliations":[{"raw_affiliation_string":"The Institute of Mathematical Sciences Taramani, Chennai -600 113, India","institution_ids":["https://openalex.org/I59611059"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5061783801"],"corresponding_institution_ids":["https://openalex.org/I59611059"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.20012801,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"10","issue":"1","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.9998000264167786,"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.9998000264167786,"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.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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9993000030517578,"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/digraph","display_name":"Digraph","score":0.9064013957977295},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8394615650177002},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.772233247756958},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6092830896377563},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.46886497735977173},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39342325925827026},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15288692712783813}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.9064013957977295},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8394615650177002},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.772233247756958},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6092830896377563},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.46886497735977173},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39342325925827026},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15288692712783813},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.37236/1739","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1739","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v10i1r46/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.4.3664","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.3664","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_10/PDF/v10i1r46.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.6.161","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.161","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_10/PostScriptfiles/v10i1r46.ps","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/1739","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1739","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v10i1r46/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.6700000166893005,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2126190768.pdf","grobid_xml":"https://content.openalex.org/works/W2126190768.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W1563577400","https://openalex.org/W2011039300","https://openalex.org/W2079330337","https://openalex.org/W2082249316","https://openalex.org/W2295428206","https://openalex.org/W4231916799","https://openalex.org/W6671084674"],"related_works":["https://openalex.org/W2038088825","https://openalex.org/W2921632378","https://openalex.org/W1975203667","https://openalex.org/W2370328482","https://openalex.org/W4287882779","https://openalex.org/W2046896701","https://openalex.org/W1996632063","https://openalex.org/W2140169421","https://openalex.org/W4378505325","https://openalex.org/W2963287622"],"abstract_inverted_index":{"Consider":[0],"the":[1,66,87],"problem":[2,21,44],"of":[3,10,19,36],"finding":[4],"a":[5,11,34,48,94],"large":[6],"induced":[7],"acyclic":[8],"subgraph":[9],"given":[12],"simple":[13],"digraph":[14],"$D=(V,E)$.":[15],"The":[16],"decision":[17],"version":[18],"this":[20,43,80],"is":[22,27,47,59,74,82],"$NP$-complete":[23],"and":[24],"its":[25],"optimization":[26],"not":[28],"likely":[29],"to":[30],"be":[31,91],"approximable":[32],"within":[33,60],"ratio":[35,81],"$O(n^{\\epsilon})$":[37],"for":[38],"some":[39],"$\\epsilon>0$.":[40],"We":[41,51],"study":[42],"when":[45,72],"$D$":[46,73],"random":[49,99],"instance.":[50],"show":[52],"that,":[53],"almost":[54],"surely,":[55],"any":[56],"maximal":[57],"solution":[58,89],"an":[61],"$o(\\ln":[62],"n)$":[63],"factor":[64],"from":[65],"optimal":[67,88],"one.":[68],"In":[69],"addition,":[70],"except":[71],"very":[75],"sparse":[76],"(having":[77],"$n^{1+o(1)}$":[78],"edges),":[79],"in":[83,93],"fact":[84],"$O(1)$.":[85],"Thus,":[86],"can":[90],"approximated":[92],"much":[95],"better":[96],"way":[97],"over":[98],"instances.":[100]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}