{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:40:57Z","timestamp":1743028857611,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319721491"},{"type":"electronic","value":"9783319721507"}],"license":[{"start":{"date-parts":[[2017,11,27]],"date-time":"2017-11-27T00:00:00Z","timestamp":1511740800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-72150-7_48","type":"book-chapter","created":{"date-parts":[[2017,11,26]],"date-time":"2017-11-26T13:21:29Z","timestamp":1511702489000},"page":"595-606","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Multitree-Like Graph Layering"],"prefix":"10.1007","author":[{"given":"Radek","family":"Marik","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,27]]},"reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"Bondy, J., Murty, U.: Graph Theory. Springer (2008)","DOI":"10.1007\/978-1-84628-970-5"},{"issue":"3","key":"48_CR2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"Brandes, U., K\u00f6pf, B.: Fast and simple horizontal coordinate assignment. In: Graph Drawing: 9th International Symposium, GD 2001 Vienna, Austria, September 23\u201326, 2001 Revised Papers, pp. 31\u201344. Springer, Berlin Heidelberg (2002)","DOI":"10.1007\/3-540-45848-4_3"},{"issue":"1","key":"48_CR4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.7155\/jgaa.00220","volume":"15","author":"M Chimani","year":"2011","unstructured":"Chimani, M., Gutwenger, C., Mutzel, P., Wong, H.M.: Upward planarization layout. J. Gr. Algorithms Appl. 15(1), 127\u2013155 (2011)","journal-title":"J. Gr. Algorithms Appl."},{"issue":"3","key":"48_CR5","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"EG Coffman","year":"1972","unstructured":"Coffman, E.G., Graham, R.L.: Optimal scheduling for two-processor systems. Acta Inform. 1(3), 200\u2013213 (1972)","journal-title":"Acta Inform."},{"key":"48_CR6","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press (2009)"},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory. Springer (2005)","DOI":"10.1007\/978-3-642-14279-6_7"},{"issue":"3","key":"48_CR8","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1111\/j.1467-8659.2009.01449.x","volume":"28","author":"T Dwyer","year":"2009","unstructured":"Dwyer, T.: Scalable, versatile and simple constrained graph layout. Comput. Gr. Forum 28(3), 991\u2013998 (2009)","journal-title":"Comput. Gr. Forum"},{"key":"48_CR9","first-page":"15","volume":"12","author":"P Eades","year":"1995","unstructured":"Eades, P., Lin, X.: A heuristic for the feedback arc set problem. Australas. J. Comb. 12, 15\u201325 (1995)","journal-title":"Australas. J. Comb."},{"issue":"4","key":"48_CR10","first-page":"424","volume":"13","author":"P Eades","year":"1991","unstructured":"Eades, P., Sugiyama, K.: How to draw a directed graph. J. Inf. Process. 13(4), 424\u2013437 (1991)","journal-title":"J. Inf. Process."},{"issue":"3","key":"48_CR11","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"ER Gansner","year":"1993","unstructured":"Gansner, E.R., Koutsofios, E., North, S.C., Vo, K.P.: A technique for drawing directed graphs. IEEE Trans. Softw. Eng. 19(3), 214\u2013230 (1993)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"11","key":"48_CR12","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1002\/1097-024X(200009)30:11<1203::AID-SPE338>3.0.CO;2-N","volume":"30","author":"ER Gansner","year":"2000","unstructured":"Gansner, E.R., North, S.C.: An open graph visualization system and its applications to software engineering. Softw. Pract. Exper. 30(11), 1203\u20131233 (2000)","journal-title":"Softw. Pract. Exper."},{"issue":"3\u20134","key":"48_CR13","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1177\/1473871612455749","volume":"12","author":"H Gibson","year":"2013","unstructured":"Gibson, H., Faith, J., Vickers, P.: A survey of two-dimensional graph layout techniques for information visualisation. Inf. Vis. 12(3\u20134), 324\u2013357 (2013)","journal-title":"Inf. Vis."},{"key":"48_CR14","doi-asserted-by":"crossref","unstructured":"Healy, P., Nikolov, N.S.: A branch-and-cut approach to the directed acyclic graph layering problem. In: Graph drawing: 10th International Symposium, GD 2002 Irvine, CA, USA, August 26\u201328, 2002 Revised Papers, pp. 98\u2013109. Springer, Berlin Heidelberg (2002)","DOI":"10.1007\/3-540-36151-0_10"},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Healy, P., Nikolov, N.S.: How to layer a directed acyclic graph. In: Revised Papers from the 9th International Symposium on Graph Drawing. GD \u201901, pp. 16\u201330. Springer-Verlag, London, UK (2002)","DOI":"10.1007\/3-540-45848-4_2"},{"key":"48_CR16","unstructured":"Healy, P., Nikolov, N.S.: Hierarchical drawing algorithms. In: Handbook of Graph Drawing and Visualization pp. 409\u2013453. CRC Press (2013)"},{"issue":"6","key":"48_CR17","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16(6), 372\u2013378 (1973)","journal-title":"Commun. ACM"},{"issue":"4","key":"48_CR18","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM 21(4), 549\u2013568 (1974)","journal-title":"J. ACM"},{"key":"48_CR19","doi-asserted-by":"crossref","unstructured":"Hsu, W.L., McConnell, R.: PQ trees, PC trees, and Planar graphs. In: Handbook of Data Structures Applications, pp. 32\u20131\u201332\u201327. CRC Press (2004)","DOI":"10.1201\/9781420035179.ch32"},{"key":"48_CR20","unstructured":"ITIS: Integrated Taxonomic Information System. https:\/\/www.itis.gov\/downloads\/index.html , http:\/\/www.itis.gov (2017). Accessed 10 Feb 2017. (from the Integrated Taxonomic Information System on-line database)"},{"key":"48_CR21","doi-asserted-by":"crossref","unstructured":"Jabrayilov, A., Mallach, S., Mutzel, P., R\u00fcegg, U., von Hanxleden, R.: Compact layered drawings of general directed graphs. In: Graph drawing and network visualization: 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, pp. 209\u2013221. Springer International Publishing, Cham (2016)","DOI":"10.1007\/978-3-319-50106-2_17"},{"key":"48_CR22","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.asoc.2015.12.018","volume":"41","author":"R Kudeli\u0107","year":"2016","unstructured":"Kudeli\u0107, R.: Monte-carlo randomized algorithm for minimal feedback arc set problem. Appl. Soft Comput. 41, 235\u2013246 (2016)","journal-title":"Appl. Soft Comput."},{"key":"48_CR23","doi-asserted-by":"publisher","unstructured":"Lempel, A., Cederbaum, I.: Minimum feedback arc and vertex sets of a directed graph. IEEE Trans. Circuit Theory 13(4), 399\u2013403 (1966). https:\/\/doi.org\/10.1109\/TCT.1966.1082620","DOI":"10.1109\/TCT.1966.1082620"},{"key":"48_CR24","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data (2017)"},{"key":"48_CR25","unstructured":"Marik, R.: On large genealogical graph layouts. In: Brejov\u00e1, B. (ed.) Proceedings of the 16th ITAT Conference Information Technologies - Applications and Theory, WASACNA 2016: Workshop on Algorithmic and Structural Aspects of Complex Networks and Applications, September 15-19, Tatransk\u00e9 Matliare, Slovakia, pp. 218\u2013225 (2016)"},{"key":"48_CR26","unstructured":"Marik, R.: Tree-based genealogical graph layout. In: Hu, Y., N\u00f6llenburg, M. (eds.) Graph Drawing and Network Visualization, 24th International Symposium, GD 2016, Athens, Greece, September 19-21 (2016). ISBN: 978-3-319-50105-5 (Print), 978-3-319-50106-2 (Online)"},{"key":"48_CR27","doi-asserted-by":"crossref","unstructured":"Marik, R.: Efficient genealogical graph layout. In: Complex Networks & Their Applications V: Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016), pp. 567\u2013578. Springer International Publishing, Cham (2017)","DOI":"10.1007\/978-3-319-50901-3_45"},{"key":"48_CR28","unstructured":"Mathematics genealogy project, department of mathematics, north dakota state university. https:\/\/www.genealogy.math.ndsu.nodak.edu\/index.php (2017). Accessed Feb 2017"},{"key":"48_CR29","doi-asserted-by":"publisher","unstructured":"Noughabi, H.A., Baghbani, F.G.: An efficient genetic algorithm for the feedback set problems. In: 2014 Iranian Conference on Intelligent Systems (ICIS), pp. 1\u20134 (2014). https:\/\/doi.org\/10.1109\/IranianCIS.2014.6802571","DOI":"10.1109\/IranianCIS.2014.6802571"},{"key":"48_CR30","doi-asserted-by":"publisher","unstructured":"Oliva, G., Setola, R., Glielmo, L., Hadjicostis, C.N.: Distributed cycle detection and removal, accepted for publication. IEEE Trans Control Netw. Syst. PP(99), 1\u20131 (2016). https:\/\/doi.org\/10.1109\/TCNS.2016.2593264","DOI":"10.1109\/TCNS.2016.2593264"},{"key":"48_CR31","unstructured":"Pruitt, P.D.: Great sites for links to genealogy software. http:\/\/famousfamilytrees.blogspot.cz\/2011\/12\/ (2017). Accessed Feb 2017"},{"key":"48_CR32","doi-asserted-by":"publisher","unstructured":"Reingold, E.M., Tilford, J.S.: Tidier drawings of trees. IEEE Trans. Softw. Eng. SE-7(2), 223\u2013228 (1981). https:\/\/doi.org\/10.1109\/TSE.1981.234519","DOI":"10.1109\/TSE.1981.234519"},{"key":"48_CR33","doi-asserted-by":"crossref","unstructured":"R\u00fcegg, U., Ehlers, T., Sp\u00f6nemann, M., von Hanxleden, R.: A generalization of the directed graph layering problem. In: Graph Drawing and Network Visualization: 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, pp. 196\u2013208. Springer International Publishing, Cham (2016)","DOI":"10.1007\/978-3-319-50106-2_16"},{"issue":"3","key":"48_CR34","doi-asserted-by":"crossref","first-page":"133","DOI":"10.14778\/3021924.3021930","volume":"10","author":"M Simpson","year":"2016","unstructured":"Simpson, M., Srinivasan, V., Thomo, A.: Efficient computation of feedback arc set at web-scale. Proc. VLDB Endow. 10(3), 133\u2013144 (2016)","journal-title":"Proc. VLDB Endow."},{"key":"48_CR35","unstructured":"Stobie, T.: Thomas stobie\u2019s genealogy pages. http:\/\/freepages.genealogy.rootsweb.ancestry.com\/~stobie\/ (2017). Accessed Feb 2017"},{"key":"48_CR36","doi-asserted-by":"publisher","unstructured":"Sugiyama, K., Misue, K.: Visualization of structural information: automatic drawing of compound digraphs. IEEE Trans. Syst. Man Cybern. 21(4), 876\u2013892 (1991). https:\/\/doi.org\/10.1109\/21.108304","DOI":"10.1109\/21.108304"},{"key":"48_CR37","doi-asserted-by":"publisher","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern. 11(2), 109\u2013125 (1981). https:\/\/doi.org\/10.1109\/TSMC.1981.4308636","DOI":"10.1109\/TSMC.1981.4308636"},{"issue":"13","key":"48_CR38","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"3","author":"WT Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. Lond. Math. Soc. Third Ser. 3(13), 743\u2013768 (1963)","journal-title":"Proc. Lond. Math. Soc. Third Ser."},{"key":"48_CR39","doi-asserted-by":"publisher","unstructured":"Warfield, J.N.: Crossing theory and hierarchy mapping. IEEE Trans. Syst. Man Cybern. 7(7), 505\u2013523 (1977). https:\/\/doi.org\/10.1109\/TSMC.1977.4309760","DOI":"10.1109\/TSMC.1977.4309760"},{"key":"48_CR40","unstructured":"Wilson, R.J.: Introduction to Graph Theory, 4th edn. Longman (1998)"},{"key":"48_CR41","doi-asserted-by":"publisher","unstructured":"Younger, D.: Minimum feedback arc sets for a directed graph. IEEE Trans. Circuit Theory 10(2), 238\u2013245 (1963). https:\/\/doi.org\/10.1109\/TCT.1963.1082116","DOI":"10.1109\/TCT.1963.1082116"}],"container-title":["Studies in Computational Intelligence","Complex Networks &amp; Their Applications VI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72150-7_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T18:28:11Z","timestamp":1659983291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72150-7_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,27]]},"ISBN":["9783319721491","9783319721507"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72150-7_48","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2017,11,27]]}}}