{"id":"https://openalex.org/W2952664587","doi":"https://doi.org/10.1137/s0097539793256685","title":"Approximating the Minimum Equivalent Digraph","display_name":"Approximating the Minimum Equivalent Digraph","publication_year":1995,"publication_date":"1995-08-01","ids":{"openalex":"https://openalex.org/W2952664587","doi":"https://doi.org/10.1137/s0097539793256685","mag":"2952664587"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539793256685","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793256685","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/cs/0205040","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042716179","display_name":"Samir Khuller","orcid":"https://orcid.org/0000-0002-5408-8023"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Samir Khuller","raw_affiliation_strings":["Computer Science Department and Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department and Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046140110","display_name":"Balaji Raghavachari","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Balaji Raghavachari","raw_affiliation_strings":["Computer Science Department, The University of Texas at Dallas, Richardson, TX 75083-0688"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, The University of Texas at Dallas, Richardson, TX 75083-0688","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006234305","display_name":"Neal E. Young","orcid":"https://orcid.org/0000-0001-8144-3345"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neal Young","raw_affiliation_strings":["School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY 14853-3801"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY 14853-3801","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.115,"has_fulltext":false,"cited_by_count":81,"citation_normalized_percentile":{"value":0.87994823,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"24","issue":"4","first_page":"859","last_page":"872"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.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"}},{"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/T12288","display_name":"Optimization and Search Problems","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/digraph","display_name":"Digraph","score":0.9005764722824097},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8594270348548889},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.6763184666633606},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5988458395004272},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5959900617599487},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5923377871513367},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5495287179946899},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5489651560783386},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5240935683250427},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4376406669616699},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4260466396808624},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3518785238265991}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.9005764722824097},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8594270348548889},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.6763184666633606},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5988458395004272},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5959900617599487},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5923377871513367},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5495287179946899},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5489651560783386},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5240935683250427},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4376406669616699},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4260466396808624},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3518785238265991},{"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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539793256685","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793256685","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:cs/0205040","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0205040","pdf_url":"https://arxiv.org/pdf/cs/0205040","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:cs/0205040","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0205040","pdf_url":"https://arxiv.org/pdf/cs/0205040","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1588377709","https://openalex.org/W1590399153","https://openalex.org/W1981358946","https://openalex.org/W1982512167","https://openalex.org/W1984224159","https://openalex.org/W1985672402","https://openalex.org/W1994466971","https://openalex.org/W1995246641","https://openalex.org/W2011039300","https://openalex.org/W2011823863","https://openalex.org/W2032378632","https://openalex.org/W2038225707","https://openalex.org/W2051699458","https://openalex.org/W2064796716","https://openalex.org/W2076447414","https://openalex.org/W2078047960","https://openalex.org/W2092113566","https://openalex.org/W2110920860","https://openalex.org/W2143391442","https://openalex.org/W2752885492","https://openalex.org/W2888871578","https://openalex.org/W3100826043","https://openalex.org/W4238798236","https://openalex.org/W4251146767"],"related_works":["https://openalex.org/W2130254085","https://openalex.org/W2033567934","https://openalex.org/W2782194400","https://openalex.org/W2765600275","https://openalex.org/W2953710272","https://openalex.org/W2365236566","https://openalex.org/W3088611359","https://openalex.org/W3196251681","https://openalex.org/W4255598955","https://openalex.org/W2350235717"],"abstract_inverted_index":{"The":[0,47,62,103,118],"minimum":[1,70,86],"equivalent":[2],"graph":[3],"(MEG)":[4],"problem":[5,28,67,78],"is":[6,29,68,134],"as":[7],"follows:":[8],"given":[9],"a":[10,14,38,50,92,98,124],"directed":[11],"graph,":[12],"find":[13],"smallest":[15],"subset":[16],"of":[17,41,53,64,101,114],"the":[18,56,65,69,85,89,111],"edges":[19],"that":[20,130],"maintains":[21],"all":[22],"reachability":[23],"relations":[24],"between":[25],"nodes.":[26],"This":[27],"NP-hard;":[30],"this":[31],"paper":[32,90],"gives":[33,91],"an":[34],"approximation":[35],"algorithm":[36,48,104],"achieving":[37,97],"performance":[39,51,99,132],"guarantee":[40,52,100,133],"about":[42],"1.64":[43],"in":[44,55],"polynomial":[45],"time.":[46],"achieves":[49],"1.75":[54],"time":[57],"required":[58],"for":[59],"transitive":[60],"closure.":[61],"heart":[63],"MEG":[66,77],"strongly":[71,81],"connected":[72,82],"spanning":[73],"subgraph":[74],"(SCSS)":[75],"problem\u2014the":[76],"restricted":[79],"to":[80,122],"digraphs.":[83],"For":[84],"SCSS":[87],"problem,":[88],"practical,":[93],"nearly":[94],"linear-time":[95],"implementation":[96],"1.75.":[102,135],"and":[105],"its":[106,131],"analysis":[107,119],"are":[108],"based":[109],"on":[110],"simple":[112],"idea":[113],"contracting":[115],"long":[116],"cycles.":[117],"applies":[120],"directly":[121],"2-Exchange,":[123],"general":[125],"\u201clocal":[126],"improvement\u201d":[127],"algorithm,":[128],"showing":[129]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-10T00:00:00"}