{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:49:30Z","timestamp":1742384970615},"reference-count":13,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2007,3,9]],"date-time":"2007-03-09T00:00:00Z","timestamp":1173398400000},"content-version":"vor","delay-in-days":8590,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1983,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Consider a hypergraph <jats:italic>H = (E, P)<\/jats:italic> where <jats:italic>E<\/jats:italic> denotes the set of vertices and <jats:italic>P<\/jats:italic> the set of edges. The hypergraph <jats:italic>H<\/jats:italic> = (<jats:italic>E, P<\/jats:italic>) is called an <jats:italic>edge\u2010tree hypergraph<\/jats:italic> if there exists a tree <jats:italic>T<\/jats:italic> with edge set <jats:italic>E<\/jats:italic> such that every <jats:italic>p = P<\/jats:italic> is a path in <jats:italic>T.<\/jats:italic> We describe a polynomial time algorithm for deciding whether a given hypergraph <jats:italic>H<\/jats:italic> = (<jats:italic>E, P<\/jats:italic>) is an edge\u2010tree hypergraph. The algorithm can be used to decide whether a binary matroid is graphic or not.<\/jats:p>","DOI":"10.1002\/net.3230130306","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T16:51:13Z","timestamp":1178902273000},"page":"377-388","source":"Crossref","is-referenced-by-count":9,"title":["An algorithm for constructing edge\u2010trees from hypergraphs"],"prefix":"10.1002","volume":"13","author":[{"given":"F\u01cenic\u01ce","family":"Gavril","sequence":"first","affiliation":[]},{"given":"Robert","family":"Tamari","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,9]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A. V.","year":"1974"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.5.3.321"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584345"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90021-7"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90003-1"},{"key":"e_1_2_1_7_2","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic M. C.","year":"1980"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1971-016-5"},{"key":"e_1_2_1_9_2","volume-title":"Discrete Mathematical Models with Application to Social, Biological and Environmental Problems","author":"Roberts F. S.","year":"1980"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579179"},{"key":"e_1_2_1_11_2","volume-title":"Combinatorial algorithms in certain classes of binary matroids","author":"Tamari R."},{"key":"e_1_2_1_12_2","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1090\/S0002-9947-1959-0101527-3","article-title":"Matroids and graphs","volume":"90","author":"Tutte W. T.","year":"1959","journal-title":"Trans. Amer. Math. Soc."},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.2307\/2034435"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.6028\/jres.069B.001"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230130306","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230130306","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T22:54:37Z","timestamp":1697756077000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230130306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,9]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,9]]}},"alternative-id":["10.1002\/net.3230130306"],"URL":"https:\/\/doi.org\/10.1002\/net.3230130306","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,9]]}}}