{"id":"https://openalex.org/W1977216722","doi":"https://doi.org/10.1002/net.3230130306","title":"An algorithm for constructing edge\u2010trees from hypergraphs","display_name":"An algorithm for constructing edge\u2010trees from hypergraphs","publication_year":1983,"publication_date":"1983-09-01","ids":{"openalex":"https://openalex.org/W1977216722","doi":"https://doi.org/10.1002/net.3230130306","mag":"1977216722"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230130306","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230130306","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078313840","display_name":"F\u01cenic\u01ce Gavril","orcid":"https://orcid.org/0000-0001-9584-2232"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"F\u01cenic\u01ce Gavril","raw_affiliation_strings":["CEMA-Center for Military Analyses, P.O. Box 2250 (17), Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"CEMA-Center for Military Analyses, P.O. Box 2250 (17), Haifa, Israel","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015621692","display_name":"Robert Tamari","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert Tamari","raw_affiliation_strings":["CEMA-Center for Military Analyses, P.O. Box 2250 (17), Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"CEMA-Center for Military Analyses, P.O. Box 2250 (17), Haifa, Israel","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078313840"],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":2.7326,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.89636521,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":"3","first_page":"377","last_page":"388"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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.9987000226974487,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9952999949455261,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.9330980777740479},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7523778676986694},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6500575542449951},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.6297863721847534},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5625550746917725},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5624379515647888},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5325761437416077},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49052947759628296},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48300230503082275},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46518009901046753},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.348663330078125},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2240728735923767},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.05935212969779968}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.9330980777740479},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7523778676986694},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6500575542449951},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.6297863721847534},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5625550746917725},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5624379515647888},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5325761437416077},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49052947759628296},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48300230503082275},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46518009901046753},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.348663330078125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2240728735923767},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.05935212969779968},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230130306","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230130306","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1970204619","https://openalex.org/W1993412054","https://openalex.org/W2011043621","https://openalex.org/W2020687920","https://openalex.org/W2033520777","https://openalex.org/W2036751548","https://openalex.org/W2062599373","https://openalex.org/W2143474538","https://openalex.org/W2182109708","https://openalex.org/W2324166574","https://openalex.org/W4240485950","https://openalex.org/W4299866835"],"related_works":["https://openalex.org/W2058299944","https://openalex.org/W4323360720","https://openalex.org/W1550144461","https://openalex.org/W4233892543","https://openalex.org/W2783959783","https://openalex.org/W2602164040","https://openalex.org/W2037206237","https://openalex.org/W4310658774","https://openalex.org/W3000635646","https://openalex.org/W3089158720"],"abstract_inverted_index":{"Abstract":[0],"Consider":[1],"a":[2,37,51,57,64,85],"hypergraph":[3,22,33,66],"H":[4,23,67],"=":[5,24,48,68],"(E,":[6],"P)":[7],"where":[8],"E":[9,43],"denotes":[10],"the":[11,17],"set":[12,18,42],"of":[13,19],"vertices":[14],"and":[15],"P":[16,27,49,71],"edges.":[20],"The":[21,77],"(":[25,69],"E,":[26,70],")":[28,72],"is":[29,50,73,88],"called":[30],"an":[31,74],"edge\u2010tree":[32,75],"if":[34],"there":[35],"exists":[36],"tree":[38],"T":[39],"with":[40],"edge":[41],"such":[44],"that":[45],"every":[46],"p":[47],"path":[52],"in":[53],"T.":[54],"We":[55],"describe":[56],"polynomial":[58],"time":[59],"algorithm":[60,78],"for":[61],"deciding":[62],"whether":[63,84],"given":[65],"hypergraph.":[76],"can":[79],"be":[80],"used":[81],"to":[82],"decide":[83],"binary":[86],"matroid":[87],"graphic":[89],"or":[90],"not.":[91]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}