{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:21:11Z","timestamp":1738387271566,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540698401"},{"type":"electronic","value":"9783540698487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69848-7_98","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"1229-1241","source":"Crossref","is-referenced-by-count":3,"title":["Network Stability Assessment Using the Number of Tree Adjacent to an Articulation Node"],"prefix":"10.1007","author":[{"given":"Yonghyoun","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyuncheol","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-wook","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kwang-jong","family":"Cho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ki-sung","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"98_CR1","unstructured":"Kim, Y., Ahn, S., Chung, J.-w.: Importance of network Articulation node of traffic base analysis techniques. In: Proceedings of the Digital Contents Society, December 2007, pp. 113\u2013117 (2007)"},{"key":"98_CR2","unstructured":"Kim, Y.h., Kim, K., Lim, C.S., Ahn, S., Chung, J.-w.: Technique of Analysis of Network\u2019s Importance through Analysis on the Relationship between an Articulation Node and its Adjacent Nodes. In: GESTS, pp. 1\u20138 (January 2008)"},{"key":"98_CR3","unstructured":"Horowitz, E., Sahni, S., Anderson-Freed, S.: Fundamentals of Data Structure in C, 2nd edn., pp. 265\u2013292. Silicon Press (August 2007)"},{"key":"98_CR4","volume-title":"Data Structures and Algorithms","author":"A.V. Aho","year":"1983","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison-Wesley, Reading (1983)"},{"key":"98_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. McGraw-Hill, New York (1990)"},{"key":"98_CR6","unstructured":"Gabow, H.N.: Path-based depth-first search for strong and biconnected components, Tech. Report CU-CS-890-99, revised version, Dept. of Computer Sciencs, University of Colorado at Boulder (2000)"},{"key":"98_CR7","volume-title":"Data Structures and Algorithm Analysis in C++","author":"M.A. Weiss","year":"1999","unstructured":"Weiss, M.A.: Data Structures and Algorithm Analysis in C++. Addison-Wesley, Reading (1999)"},{"key":"98_CR8","unstructured":"Huang, S.T.: A new distributed algorithm for the biconnectivity problem. In: Proc. of International Conf. on Parallel Processing, vol.\u00a03, pp. 106\u2013113 (1989)"},{"key":"98_CR9","unstructured":"Tarjan, R.E., Vishkin, U.: An efficient parallel biconnectivity algorithm, TR-69, Ultracomputer Note-51, Courant Institute of Mathematical Sciences, NY (1983)"},{"issue":"18","key":"98_CR10","doi-asserted-by":"publisher","first-page":"1707","DOI":"10.1016\/S0140-3664(98)00211-4","volume":"21","author":"P. Chaudhuri","year":"1998","unstructured":"Chaudhuri, P.: An optimal distributed algorithm for finding articulation points in a network. Computer Communications\u00a021(18), 1707\u20131715 (1998)","journal-title":"Computer Communications"},{"issue":"3","key":"98_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0020-0190(96)00153-6","volume":"60","author":"Y.D. Liang","year":"1996","unstructured":"Liang, Y.D., Rhee, C.: Finding biconnected components in O(n) time for a class of graphs. Information Processing Letters\u00a060(3), 159\u2013163 (1996)","journal-title":"Information Processing Letters"},{"key":"98_CR12","doi-asserted-by":"crossref","unstructured":"Woo, J., Sahni, S.: Computing biconnected components on a hypercube. In: Second IEEE Workshop on Future Trends of 1990 Distributed Computing Systems, pp. 277\u2013283 (1990)","DOI":"10.1109\/FTDCS.1990.138333"},{"key":"98_CR13","unstructured":"Ziemer, R.E (translator)., Kim, J.-k.: Elements of Engineering Probability and Statistics, November 2003, pp. 90\u201392. HongRueng pub. (2003)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69848-7_98.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:09:16Z","timestamp":1738325356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69848-7_98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540698401","9783540698487"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69848-7_98","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}