{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:29:44Z","timestamp":1743125384646,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030835071"},{"type":"electronic","value":"9783030835088"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-83508-8_41","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"571-584","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time"],"prefix":"10.1007","author":[{"given":"Arne","family":"Leitert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"issue":"3","key":"41_CR1","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C Beeri","year":"1983","unstructured":"Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. J. ACM 30(3), 479\u2013513 (1983). https:\/\/doi.org\/10.1145\/2402.322389","journal-title":"J. ACM"},{"key":"41_CR2","unstructured":"Berry, A., Simonet, G.: Computing the atom graph of a graph and the union join graph of a hypergraph. CoRR abs\/1607.02911 (2016)"},{"key":"41_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.entcs.2016.03.005","volume":"322","author":"M Borassi","year":"2016","unstructured":"Borassi, M., Crescenzi, P., Habib, M.: Into the square: on the complexity of some quadratic-time solvable problems. Electron. Notes Theor. Comput. Sci. 322, 51\u201367 (2016). https:\/\/doi.org\/10.1016\/j.entcs.2016.03.005","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"41_CR4","unstructured":"Brandst\u00e4dt, A., Dragan, F.F.: Tree-structured graphs. In: Handbook of Graph Theory, Combinatorial Optimization, and Algorithms, pp. 751\u2013826. CRC Press (2015)"},{"issue":"3","key":"41_CR5","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1137\/S0895480193253415","volume":"11","author":"A Brandst\u00e4dt","year":"1998","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., Chepoi, V., Voloshin, V.I.: Dually chordal graphs. SIAM J. Discret. Math. 11(3), 437\u2013455 (1998). https:\/\/doi.org\/10.1137\/S0895480193253415","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"41_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.7155\/jgaa.00109","volume":"9","author":"Y Dourisboure","year":"2005","unstructured":"Dourisboure, Y.: Compact routing schemes for generalised chordal graphs. J. Graph Algorithms Appl. 9(2), 277\u2013297 (2005). https:\/\/doi.org\/10.7155\/jgaa.00109","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"41_CR7","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.tcs.2007.03.058","volume":"383","author":"Y Dourisboure","year":"2007","unstructured":"Dourisboure, Y., Dragan, F.F., Gavoille, C., Yan, C.: Spanners for bounded tree-length graphs. Theoret. Comput. Sci. 383(1), 34\u201344 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.03.058","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"41_CR8","doi-asserted-by":"publisher","first-page":"884","DOI":"10.1007\/s00453-013-9765-4","volume":"69","author":"FF Dragan","year":"2013","unstructured":"Dragan, F.F., K\u00f6hler, E.: An approximation algorithm for the tree t-spanner problem on unweighted graphs via generalized chordal graphs. Algorithmica 69(4), 884\u2013905 (2013). https:\/\/doi.org\/10.1007\/s00453-013-9765-4","journal-title":"Algorithmica"},{"issue":"18","key":"41_CR9","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.1016\/j.ipl.2009.07.001","volume":"109","author":"A Elmasry","year":"2009","unstructured":"Elmasry, A.: Computing the subset partial order for dense families of sets. Inf. Process. Lett. 109(18), 1082\u20131086 (2009). https:\/\/doi.org\/10.1016\/j.ipl.2009.07.001","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"41_CR10","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/2402.322390","volume":"30","author":"R Fagin","year":"1983","unstructured":"Fagin, R.: Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM 30(3), 514\u2013550 (1983). https:\/\/doi.org\/10.1145\/2402.322390","journal-title":"J. ACM"},{"key":"41_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/3-540-60618-1_88","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P Galinier","year":"1995","unstructured":"Galinier, P., Habib, M., Paul, C.: Chordal graphs and their clique graphs. In: Nagl, M. (ed.) WG 1995. LNCS, vol. 1017, pp. 358\u2013371. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60618-1_88"},{"issue":"1","key":"41_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory Ser. B 16(1), 47\u201356 (1974). https:\/\/doi.org\/10.1016\/0095-8956(74)90094-X","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1\u20132","key":"41_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(97)00241-7","volume":"234","author":"M Habib","year":"2000","unstructured":"Habib, M., McConnell, R.M., Paul, C., Viennot, L.: LEX-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theor. Comput. Sci. 234(1\u20132), 59\u201384 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(97)00241-7","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"41_CR14","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1016\/j.ejc.2011.09.031","volume":"33","author":"M Habib","year":"2012","unstructured":"Habib, M., Stacho, J.: Reduced clique graphs of chordal graphs. Eur. J. Comb. 33(5), 712\u2013735 (2012). https:\/\/doi.org\/10.1016\/j.ejc.2011.09.031","journal-title":"Eur. J. Comb."},{"issue":"4\u20135","key":"41_CR15","first-page":"433","volume":"7","author":"B Kaba","year":"2007","unstructured":"Kaba, B., Pinet, N., Lelandais, G., Sigayret, A., Berry, A.: Clustering gene expression data using graph separators. Silico Biol. 7(4\u20135), 433\u2013452 (2007)","journal-title":"Silico Biol."},{"issue":"1\u20133","key":"41_CR16","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0012-365X(93)90510-Z","volume":"113","author":"H Leimer","year":"1993","unstructured":"Leimer, H.: Optimal decomposition by clique separators. Discret. Math. 113(1\u20133), 99\u2013123 (1993). https:\/\/doi.org\/10.1016\/0012-365X(93)90510-Z","journal-title":"Discret. Math."},{"key":"41_CR17","doi-asserted-by":"crossref","unstructured":"Leitert, A.: Computing the union join and subset graph of acyclic hypergraphs in subquadratic time. CoRR abs\/2104.06636 (2021)","DOI":"10.1007\/978-3-030-83508-8_41"},{"issue":"6","key":"41_CR18","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987). https:\/\/doi.org\/10.1137\/0216062","journal-title":"SIAM J. Comput."},{"issue":"8","key":"41_CR19","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/BF01261654","volume":"28","author":"P Pritchard","year":"1991","unstructured":"Pritchard, P.: Opportunistic algorithms for eliminating supersets. Acta Inform. 28(8), 733\u2013754 (1991). https:\/\/doi.org\/10.1007\/BF01261654","journal-title":"Acta Inform."},{"issue":"2","key":"41_CR20","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jagm.1999.1032","volume":"33","author":"P Pritchard","year":"1999","unstructured":"Pritchard, P.: On computing the subset graph of a collection of sets. J. Algorithms 33(2), 187\u2013203 (1999). https:\/\/doi.org\/10.1006\/jagm.1999.1032","journal-title":"J. Algorithms"},{"issue":"3","key":"41_CR21","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"RE Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13(3), 566\u2013579 (1984). https:\/\/doi.org\/10.1137\/0213035","journal-title":"SIAM J. Comput."},{"issue":"7","key":"41_CR22","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1016\/j.dam.2008.09.006","volume":"157","author":"R Uehara","year":"2009","unstructured":"Uehara, R., Uno, Y.: Laminar structure of ptolemaic graphs with applications. Discret. Appl. Math. 157(7), 1533\u20131543 (2009). https:\/\/doi.org\/10.1016\/j.dam.2008.09.006","journal-title":"Discret. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:29:22Z","timestamp":1645183762000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"123","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}