{"id":"https://openalex.org/W1972004026","doi":"https://doi.org/10.1137/s0097539793250299","title":"Identifying the Minimal Transversals of a Hypergraph and Related Problems","display_name":"Identifying the Minimal Transversals of a Hypergraph and Related Problems","publication_year":1995,"publication_date":"1995-12-01","ids":{"openalex":"https://openalex.org/W1972004026","doi":"https://doi.org/10.1137/s0097539793250299","mag":"1972004026"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539793250299","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793250299","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/A5082178480","display_name":"Thomas Eiter","orcid":"https://orcid.org/0000-0001-6003-6345"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Thomas Eiter","raw_affiliation_strings":["Vienna University of Technology"],"affiliations":[{"raw_affiliation_string":"Vienna University of Technology","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050151740","display_name":"Georg Gottlob","orcid":"https://orcid.org/0000-0002-2353-5230"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Georg Gottlob","raw_affiliation_strings":["Vienna University of Technology"],"affiliations":[{"raw_affiliation_string":"Vienna University of Technology","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5082178480"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":11.3227,"has_fulltext":false,"cited_by_count":423,"citation_normalized_percentile":{"value":0.98632252,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"24","issue":"6","first_page":"1278","last_page":"1304"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9966999888420105,"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.9966999888420105,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9930999875068665,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.991599977016449,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.988473653793335},{"id":"https://openalex.org/keywords/transversal","display_name":"Transversal (combinatorics)","score":0.8648761510848999},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6967774033546448},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6264578700065613},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.508995532989502},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4843517541885376},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44720426201820374}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.988473653793335},{"id":"https://openalex.org/C2780130068","wikidata":"https://www.wikidata.org/wiki/Q2208651","display_name":"Transversal (combinatorics)","level":2,"score":0.8648761510848999},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6967774033546448},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6264578700065613},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.508995532989502},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4843517541885376},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44720426201820374},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0097539793250299","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793250299","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:CiteSeerX.psu:10.1.1.36.9778","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.9778","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.kr.tuwien.ac.at/staff/eiter/1842-papers/cdtr9116.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.37.883","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.kr.tuwien.ac.at/staff/eiter/1842-papers/eite-gott-95.ps.gz","raw_type":"text"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:9d7d9171-4265-4bc0-9994-a1f5c213e83e","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:9d7d9171-4265-4bc0-9994-a1f5c213e83e","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science","raw_type":"Journal article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7400000095367432}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W52840101","https://openalex.org/W103073075","https://openalex.org/W180578187","https://openalex.org/W189909378","https://openalex.org/W1484529399","https://openalex.org/W1547414429","https://openalex.org/W1984098916","https://openalex.org/W1991477862","https://openalex.org/W1998575442","https://openalex.org/W2006912660","https://openalex.org/W2007940874","https://openalex.org/W2011039300","https://openalex.org/W2011042573","https://openalex.org/W2017205387","https://openalex.org/W2018099718","https://openalex.org/W2020580827","https://openalex.org/W2026143151","https://openalex.org/W2030087828","https://openalex.org/W2039610696","https://openalex.org/W2041324781","https://openalex.org/W2047482026","https://openalex.org/W2052960791","https://openalex.org/W2055981802","https://openalex.org/W2057512592","https://openalex.org/W2059867571","https://openalex.org/W2063645305","https://openalex.org/W2065895258","https://openalex.org/W2086073919","https://openalex.org/W2087567316","https://openalex.org/W2089417393","https://openalex.org/W2093776691","https://openalex.org/W2098102356","https://openalex.org/W2104498537","https://openalex.org/W2108309071","https://openalex.org/W2115822498","https://openalex.org/W2142820657","https://openalex.org/W2144386448","https://openalex.org/W2148043549","https://openalex.org/W2148417962","https://openalex.org/W2153485419","https://openalex.org/W2162621793","https://openalex.org/W2171361281","https://openalex.org/W2397160827","https://openalex.org/W4206794571","https://openalex.org/W4231922962","https://openalex.org/W4234449555","https://openalex.org/W4242448640"],"related_works":["https://openalex.org/W2772332644","https://openalex.org/W1603162376","https://openalex.org/W2914515209","https://openalex.org/W1564907238","https://openalex.org/W2366416021","https://openalex.org/W2153126276","https://openalex.org/W4234443931","https://openalex.org/W1570878271","https://openalex.org/W1486064475","https://openalex.org/W3009653673"],"abstract_inverted_index":{"The":[0,101],"paper":[1],"considers":[2],"two":[3,83],"decision":[4],"problems":[5,23],"on":[6],"hypergraphs,":[7],"hypergraph":[8,33,59,79],"saturation":[9,62],"and":[10,16],"recognition":[11,110],"of":[12,39,48,58,63,99,103,111,117],"the":[13,61,90,96,104,109,112,115,118,131],"transversal":[14,78,113,119],"hypergraph,":[15,114,120],"discusses":[17],"their":[18],"significance":[19],"for":[20],"several":[21,143],"search":[22,105],"in":[24,43,92,130],"applied":[25],"computer":[26],"science.":[27],"Hypergraph":[28],"saturation,":[29,60],"i.e.,":[30,81],"given":[31,82],"a":[32],"H,":[34,49],"decide":[35,88],"if":[36,89],"every":[37],"subset":[38],"vertices":[40],"is":[41,50,69,121,135],"contained":[42],"or":[44],"contains":[45],"some":[46],"edge":[47],"shown":[51,70],"to":[52,71,77,108],"be":[53,72],"co-NP-complete.":[54],"A":[55],"certain":[56],"subproblem":[57],"simple":[64],"hypergraphs":[65,84],"(i.e.":[66],"Sperner":[67],"families),":[68],"under":[73],"polynomial":[74],"transformation":[75],"equivalent":[76],"recognition,":[80],"H1":[85],",":[86],"H2,":[87],"sets":[91],"H2":[93],"are":[94],"all":[95],"minimal":[97],"transversals":[98],"H1.":[100],"complexity":[102],"problem":[106],"related":[107],"computation":[116],"an":[122,138],"open":[123],"problem.":[124],"This":[125],"task":[126],"needs":[127],"time":[128],"exponential":[129],"input":[132],"size;":[133],"it":[134],"unknown":[136],"whether":[137],"output-polynomial":[139],"algorithm":[140],"exists.":[141],"For":[142],"important":[144],"subcases,...":[145]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":16},{"year":2016,"cited_by_count":21},{"year":2015,"cited_by_count":20},{"year":2014,"cited_by_count":16},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":14}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}