{"id":"https://openalex.org/W4252143234","doi":"https://doi.org/10.1137/0214020","title":"Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs","display_name":"Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs","publication_year":1985,"publication_date":"1985-02-01","ids":{"openalex":"https://openalex.org/W4252143234","doi":"https://doi.org/10.1137/0214020"},"language":"en","primary_location":{"id":"doi:10.1137/0214020","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214020","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":["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/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Robert E. Tarjan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5043084405","display_name":"Mihalis Yannakakis","orcid":"https://orcid.org/0000-0003-2857-1860"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mihalis Yannakakis","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051027549"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6811,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.78801986,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"14","issue":"1","first_page":"254","last_page":"255"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9991000294685364,"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.9991000294685364,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/addendum","display_name":"Addendum","score":0.5644054412841797},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5057084560394287},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.5004785060882568},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4935861825942993},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4564379155635834},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4511137306690216},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4494025409221649},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4230983555316925},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41375935077667236},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4064006209373474},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.29266953468322754}],"concepts":[{"id":"https://openalex.org/C2778945725","wikidata":"https://www.wikidata.org/wiki/Q352858","display_name":"Addendum","level":2,"score":0.5644054412841797},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5057084560394287},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.5004785060882568},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4935861825942993},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4564379155635834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4511137306690216},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4494025409221649},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4230983555316925},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41375935077667236},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4064006209373474},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.29266953468322754},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"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":1,"locations":[{"id":"doi:10.1137/0214020","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214020","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.550000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1563201300","https://openalex.org/W37587837","https://openalex.org/W2179537243","https://openalex.org/W605190670","https://openalex.org/W2756545775","https://openalex.org/W2324883613","https://openalex.org/W3089158720","https://openalex.org/W191877893","https://openalex.org/W2584187496","https://openalex.org/W2996212809"],"abstract_inverted_index":{"Previous":[0,60],"article":[1,61],"Addendum:":[2],"Simple":[3,36],"Linear-Time":[4,37,182],"Algorithms":[5,38,183,326,539,570,609],"to":[6,31,39,212],"Test":[7,11,40,44],"Chordality":[8,41],"of":[9,13,42,46,148,216,257,273,416,481,593,636,687,708,742,768,776,788,804,823],"Graphs,":[10,43],"Acyclicity":[12,45],"Hypergraphs,":[14,47],"and":[15,22,27,48,75,127,157,168,188,192,259,294,327,344,384,399,493,544,553,576,614,619,644,651,810,815,849,865],"Selectively":[16,49],"Reduce":[17,50],"Acyclic":[18,51],"HypergraphsRobert":[19],"E.":[20,25,653],"Tarjan":[21,26],"Mihalis":[23,28],"YannakakisRobert":[24],"Yannakakishttps://doi.org/10.1137/0214020PDFBibTexSections":[29],"ToolsAdd":[30],"favoritesExport":[32],"CitationTrack":[33],"CitationsEmail":[34],"SectionsAbout\"Addendum:":[35],"Hypergraphs.\"":[52],"SIAM":[53],"Journal":[54,196,347,557,622,655,791,833],"on":[55,72,114,153,155,197,348,463,516,558,623,640,656,715,774,792,808,821,834],"Computing,":[56,261,559,657,793],"14(1),":[57],"pp.":[58],"254\u2013255":[59],"FiguresRelatedReferencesCited":[62],"ByDetails":[63],"Learning":[64],"Hyperedge":[65,144],"Replacement":[66,145],"Grammars":[67],"for":[68,184,252,378,394,435,458,489,505,540,571,610,691,736,762,847,863],"Graph":[69,146,380],"GenerationIEEE":[70],"Transactions":[71],"Pattern":[73],"Analysis":[74],"Machine":[76],"Intelligence,":[77,492],"Vol.":[78,93,133,172,200,221,239,262,329,351,364,405,421,445,467,560,596,626,658,696,722,748,794],"41,":[79],"No.":[80,174,202,331,353,366,407,423,447,469,562,598,628,660,698,724,750,796],"3":[81,599,629],"|":[82,95,119,135,160,176,204,223,241,264,284,301,333,355,368,386,409,425,449,471,495,518,532,564,584,600,630,662,679,700,726,752,779,798],"1":[83,96,120,136,203,224,242,265,285,302,369,387,410,426,450,472,496,519,585,601,631,701,727,753,780],"Mar":[84,243,728],"2019":[85],"Cross":[86,99,123,139,164,180,227,245,268,288,305,337,372,390,413,429,453,475,499,522,536,588,604,683,704,730,756,783,826],"Ref":[87,100,124,140,165,181,228,246,269,289,306,338,373,391,414,430,454,476,500,523,537,589,605,684,705,731,757,784,827],"Paired":[88],"threshold":[89],"graphsDiscrete":[90,402,418],"Applied":[91,131,403,419,850,866],"Mathematics,":[92,132,171,199,325,350,404,420,625],"250":[94],"Dec":[97,121],"2018":[98,122],"Detecting":[101],"Highly":[102],"Overlapping":[103],"Community":[104],"Structure":[105],"by":[106,234,461],"Model-based":[107],"Maximal":[108],"Clique":[109],"Expansion2018":[110],"IEEE":[111,513],"International":[112,152,514],"Conference":[113,154,515],"Big":[115],"Data":[116],"(Big":[117],"Data)":[118],"Strict":[125],"chordal":[126,255,417,673,809],"strict":[128],"split":[129],"digraphsDiscrete":[130],"216":[134],"Jan":[137,286,303,388,497,520,586,781],"2017":[138],"Growing":[141],"Graphs":[142,543,575,613],"from":[143],"GrammarsProceedings":[147],"the":[149,436,506,737,763],"25th":[150],"ACM":[151],"Information":[156],"Knowledge":[158],"Management":[159,283],"24":[161],"October":[162],"2016":[163,179],"Tree":[166],"decompositions":[167],"social":[169],"graphsInternet":[170],"12,":[173,446],"5":[175,661,797],"16":[177],"May":[178,370,702,838],"Finding":[185,291],"Tucker":[186,292],"Submatrices":[187,293],"Lekkerkerker--Boland":[189],"SubgraphsNathan":[190],"Lindzey":[191],"Ross":[193,548],"M.":[194,549],"McConnellSIAM":[195],"Discrete":[198,349,624],"30,":[201],"12":[205],"January":[206],"2016AbstractPDF":[207],"(857":[208],"KB)A":[209],"faster":[210],"algorithm":[211,251,735,761],"recognize":[213],"even-hole-free":[214],"graphsJournal":[215],"Combinatorial":[217,594],"Theory,":[218],"Series":[219],"B,":[220],"113":[222],"Jul":[225,427,451],"2015":[226,244,267],"Edge":[229],"deletion":[230],"problems:":[231],"Branching":[232,376],"facilitated":[233],"modular":[235],"decompositionTheoretical":[236],"Computer":[237,299,582,677,746,777,824],"Science,":[238,747],"573":[240],"A":[247,270,374,431,478,501],"new":[248],"augmentation":[249],"based":[250],"extracting":[253],"maximal":[254],"subgraphsJournal":[256],"Parallel":[258,706],"Distributed":[260],"76":[263],"Feb":[266],"New":[271],"Class":[272],"Lineage":[274],"Expressions":[275],"over":[276],"Probabilistic":[277],"Databases":[278],"Computable":[279],"in":[280,298,440,484,509,525,581,676],"P-TimeScalable":[281],"Uncertainty":[282],"2013":[287,304],"On":[290,339,590],"Lekkerkerker-Boland":[295],"SubgraphsGraph-Theoretic":[296],"Concepts":[297,580,675],"Science":[300,362,583,678,778,825],"BOUNDED":[307],"SEARCH":[308],"TREE":[309],"ALGORITHMS":[310],"FOR":[311],"PARAMETRIZED":[312],"COGRAPH":[313],"DELETION:":[314],"EFFICIENT":[315],"BRANCHING":[316],"RULES":[317],"BY":[318],"EXPLOITING":[319],"STRUCTURES":[320],"OF":[321],"SPECIAL":[322],"GRAPH":[323],"CLASSESDiscrete":[324],"Applications,":[328,721],"04,":[330],"01":[332],"13":[334,424],"April":[335],"2012":[336],"$3$-Colorable":[340],"$P_5$-Free":[341],"GraphsFr\u00e9d\u00e9ric":[342],"Maffray":[343],"Gr\u00e9gory":[345],"MorelSIAM":[346],"26,":[352],"4":[354,699],"27":[356],"November":[357],"2012AbstractPDF":[358,567],"(1151":[359],"KB)Certifying":[360,569],"algorithmsComputer":[361],"Review,":[363],"5,":[365],"2":[367,470,563,751],"2011":[371],"Novel":[375],"Strategy":[377],"Parameterized":[379,637],"Modification":[381],"ProblemsCombinatorial":[382],"Optimization":[383],"Applications":[385],"2010":[389],"Certifying":[392,538,606],"algorithms":[393,457],"recognizing":[395],"proper":[396],"circular-arc":[397,401],"graphs":[398],"unit":[400],"157,":[406],"15":[408],"Aug":[411],"2009":[412,535],"Polarity":[415],"156,":[422],"2008":[428,452,474,498,521],"Fixed-Parameter":[432,502],"Tractable":[433,503],"Approach":[434],"Wavelength":[437,507],"Assignment":[438,508],"Problem":[439],"Transparent":[441],"NetworksIEEE":[442],"Communications":[443,517],"Letters,":[444,466,695],"7":[448,533],"Two":[455],"fixed-parameter":[456],"Vertex":[459],"Covering":[460],"Paths":[462],"TreesInformation":[464],"Processing":[465,694],"106,":[468],"Apr":[473],"Treewidth:":[477],"Useful":[479],"Marker":[480],"Empirical":[482],"Hardness":[483],"Quantified":[485],"Boolean":[486],"Logic":[487],"EncodingsLogic":[488],"Programming,":[490],"Artificial":[491],"Reasoning":[494],"Algorithm":[504],"WDM":[510],"Mesh":[511],"Networks2008":[512],"Advances":[524],"Register":[526],"Allocation":[527],"TechniquesThe":[528],"Compiler":[529],"Design":[530],"Handbook":[531],"December":[534],"Recognizing":[541,572],"Interval":[542,612,616,646],"Permutation":[545],"GraphsDieter":[546],"Kratsch,":[547],"McConnell,":[550],"Kurt":[551],"Mehlhorn,":[552],"Jeremy":[554],"P.":[555],"SpinradSIAM":[556],"36,":[561],"17":[565,680],"February":[566],"(253":[568],"Proper":[573,611,615,645],"Circular-Arc":[574,578],"Unit":[577],"GraphsGraph-Theoretic":[579],"2006":[587,842],"Split-Coloring":[591],"ProblemsJournal":[592],"Optimization,":[595],"10,":[597],"Nov":[602,754],"2005":[603,682],"LexBFS":[607],"Recognition":[608],"BigraphsPavol":[617],"Hell":[618],"Jing":[620],"HuangSIAM":[621],"18,":[627],"August":[632],"2006AbstractPDF":[633,665,801],"(199":[634],"KB)Tractability":[635,803],"Completion":[638],"Problems":[639],"Chordal,":[641,643],"Strongly":[642],"GraphsHaim":[647],"Kaplan,":[648],"Ron":[649],"Shamir,":[650],"Robert":[652],"TarjanSIAM":[654],"28,":[659],"28":[663],"July":[664,800,841],"(361":[666],"KB)Minimal":[667],"elimination":[668,710,739,765],"ordering":[669,740,766],"inside":[670],"a":[671],"given":[672],"graphGraph-Theoretic":[674],"June":[681],"Fixed-parameter":[685],"tractability":[686],"graph":[688],"modification":[689],"problems":[690,807],"hereditary":[692],"propertiesInformation":[693],"58,":[697],"1996":[703],"computation":[707],"perfect":[709],"schemes":[711],"using":[712],"partition":[713],"techniques":[714],"triangulated":[716],"graphsComputers":[717],"&":[718,854],"Mathematics":[719,867],"with":[720],"29,":[723],"6":[725],"1995":[729],"An":[732,758],"efficient":[733,759],"parallel":[734,760],"minimal":[738,764],"(MEO)":[741,767],"an":[743,769],"arbitrary":[744,770],"graphTheoretical":[745],"134,":[749],"1994":[755],"graph30th":[771],"Annual":[772,819],"Symposium":[773,820],"Foundations":[775,822],"1989":[782],"Doubly":[785],"Lexical":[786],"Orderings":[787],"MatricesAnna":[789],"LubiwSIAM":[790],"16,":[795],"31":[799],"(3081":[802],"parameterized":[805],"completion":[806],"interval":[811],"graphs:":[812],"minimum":[813],"fill-in":[814],"physical":[816],"mappingProceedings":[817],"35th":[818],"Volume":[828],"14,":[829],"Issue":[830],"1|":[831],"1985SIAM":[832],"Computing1-255":[835],"History":[836],"Submitted:29":[837],"1984Published":[839],"online:13":[840],"InformationCopyright":[843],"\u00a9":[844],"1985":[845],"Society":[846],"Industrial":[848,864],"MathematicsPDF":[851],"Download":[852],"Article":[853],"Publication":[855],"DataArticle":[856],"DOI:10.1137/0214020Article":[857],"page":[858],"range:pp.":[859],"254-255ISSN":[860],"(print):0097-5397ISSN":[861],"(online):1095-7111Publisher:Society":[862]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}