乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:45Z","timestamp":1725512025892},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709039"},{"type":"electronic","value":"9783540709046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70904-6_39","type":"book-chapter","created":{"date-parts":[[2007,5,17]],"date-time":"2007-05-17T15:44:43Z","timestamp":1179416683000},"page":"405-416","source":"Crossref","is-referenced-by-count":7,"title":["Biclique Edge Cover Graphs and Confluent Drawings"],"prefix":"10.1007","author":[{"given":"Michael","family":"Hirsch","sequence":"first","affiliation":[]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[]},{"given":"David","family":"Rappaport","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","unstructured":"Devine, J.: Confluent graphs. Master\u2019s thesis, Queen\u2019s University (2005)"},{"key":"39_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/978-3-540-31843-9_32","volume-title":"Graph Drawing","author":"P. Hui","year":"2005","unstructured":"Hui, P., Schaefer, M., \u0160tefankovi\u010d, D.: Train tracks and confluent drawings. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 318\u2013328. Springer, Heidelberg (2005)"},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/72910.73350","volume-title":"Proc. 2nd Int. Works. on Soft. configuration management","author":"F.J. Newbery","year":"1989","unstructured":"Newbery, F.J.: Edge concentration: a method for clustering directed graphs. In: Proc. 2nd Int. Works. on Soft. configuration management, Princeton, New Jersey, United States, pp. 76\u201385. ACM Press, New York (1989), doi:10.1145\/72910.73350"},{"key":"39_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/978-3-540-31843-9_20","volume-title":"Graph Drawing","author":"D. Eppstein","year":"2005","unstructured":"Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent layered drawings. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 184\u2013194. Springer, Heidelberg (2005)"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Goodrich, M.T., Meng, J.Y.: Delta-confluent drawings. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 165\u2013176. Springer, Heidelberg (2006)","DOI":"10.1007\/11618058_16"},{"key":"39_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Graph Drawing","author":"M.T. Dickerson","year":"2004","unstructured":"Dickerson, M.T., Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent drawings: visualizing non-planar diagrams in a planar way. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, Springer, Heidelberg (2004)"},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM Journal on Computing\u00a06, 505\u2013517 (1977)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"39_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.dam.2003.09.004","volume":"145","author":"G. Alexe","year":"2004","unstructured":"Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P.L., Simeone, B.: Consensus algorithms for the generation of all maximal bicliques. Discrete Applied Mathematics\u00a0145(1), 11\u201321 (2004)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"39_CR9","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput.\u00a014(1), 210\u2013223 (1985), doi:10.1137\/0214017","journal-title":"SIAM J. Comput."},{"issue":"4","key":"39_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0190(94)90121-X","volume":"51","author":"D. Eppstein","year":"1994","unstructured":"Eppstein, D.: Arboricity and bipartite subgraph listing algorithms. Information Processing Letters\u00a051(4), 207\u2013211 (1994), \n \n citeseer.ist.psu.edu\/eppstein94arboricity.html","journal-title":"Information Processing Letters"},{"key":"39_CR11","unstructured":"Hirsch, M.: Generating confluent drawings: Theory and practice. Master\u2019s thesis, Queen\u2019s University (2006)"},{"key":"39_CR12","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1145\/220279.220312","volume-title":"Proc. 11th Annual Symp. Computational Geometry (SCG \u201995)","author":"G. Di Battista","year":"1995","unstructured":"Di Battista, G., Garg, A., Liotta, G.: An experimental comparison of three graph drawing algorithms (extended abstract). In: Proc. 11th Annual Symp. Computational Geometry (SCG \u201995), Vancouver, British Columbia, Canada, pp. 306\u2013315. ACM Press, New York (1995), doi:10.1145\/220279.220312"},{"issue":"11","key":"39_CR13","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1002\/1097-024X(200009)30:11<1203::AID-SPE338>3.0.CO;2-N","volume":"30","author":"E.R. Gansner","year":"2000","unstructured":"Gansner, E.R., North, S.C.: An open graph visualization system and its applications to software engineering. Softw. Pract. Exper.\u00a030(11), 1203\u20131233 (2000)","journal-title":"Softw. Pract. Exper."},{"key":"39_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/3-540-63938-1_78","volume-title":"Graph Drawing","author":"N.S. Barghouti","year":"1997","unstructured":"Barghouti, N.S., Mocenigo, J., Lee, W.: Grappa: A graph package in java. In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 336\u2013343. Springer, Heidelberg (1997)"},{"key":"39_CR15","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G. Battista Di","year":"1998","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs (1998)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70904-6_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:11:33Z","timestamp":1605762693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70904-6_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709039","9783540709046"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70904-6_39","relation":{},"subject":[]}}