{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:07Z","timestamp":1725488587434},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"},{"type":"electronic","value":"9783540446699"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44669-9_38","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:32:26Z","timestamp":1186741946000},"page":"384-387","source":"Crossref","is-referenced-by-count":2,"title":["A Combinatorial Aggregation Algorithm for Stationary Distribution of a Large Markov Chain"],"prefix":"10.1007","author":[{"given":"Anna","family":"Gambin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Pokarowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"38_CR1","volume-title":"Decomposability: Queueing and Computer System Applications","author":"P. J. Courtois","year":"1977","unstructured":"Courtois, P. J.: Decomposability: Queueing and Computer System Applications, Academic Press, New York, 1977."},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/0917021","volume":"17","author":"T. Dayar","year":"1996","unstructured":"Dayar, T. and Stewart, W.J.: On the effects of using the Grassman-Taksar-Heyman method in iterative aggregation-disaggregation, SIAM Journal on Scientific Computing, vol. 17, 1996, pp. 287\u2013303.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"38_CR3","unstructured":"Kafeety, D.D., Meyer, C.D. and Stewart, W.J.: A General Framework for Iterative Aggregation\/Disaggregation Methods, Proceedings of the Fourth Copper Mountain Conference on Iterative Methods, 1992."},{"key":"38_CR4","volume-title":"Finite Markov Chains","author":"J.G. Kemeny","year":"1960","unstructured":"Kemeny, J.G. and Snell, J.L.: Finite Markov Chains. Van Nostrand, Princeton, 1960."},{"key":"38_CR5","unstructured":"Pokarowski, P. Directed forests and algorithms related to Markov chains, PhD thesis Institute of Mathematics, Polish Academy of Sciences, 1998."},{"issue":"4","key":"38_CR6","doi-asserted-by":"crossref","first-page":"395","DOI":"10.4064\/am-26-4-395-414","volume":"26","author":"P. Pokarowski","year":"1999","unstructured":"Pokarowski, P. Directed forests with applications to algorithms related to Markov chains, Applicationes Mathematicae, vol. 26, no. 4, 1999, pp. 395\u2013414.","journal-title":"Applicationes Mathematicae"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Stewart, W. J.: Introduction to the numerical solution of Markov chains, Princeton University Press, 1994.","DOI":"10.1515\/9780691223384"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44669-9_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T19:03:03Z","timestamp":1684004583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424871","9783540446699"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_38","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}