المؤلفون: Andrews, M., Chuzhoy, J., Sanjeev Khanna, Zhang, L.

المصدر: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) Foundations of Computer Science Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on. :226-241 2005

Relation: 46th Annual IEEE Symposium on Foundations of Computer Science

المؤلفون: Chuzhoy, J., Naor, J.S.

المصدر: 45th Annual IEEE Symposium on Foundations of Computer Science Foundations of computer science Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on. :108-114 2004

Relation: Proceedings. 45th Annual IEEE Symposium on Foundations of Computer Science

المؤلفون: Chuzhoy, J., Guha, S., Khanna, S., Naor, J.S.

المصدر: 45th Annual IEEE Symposium on Foundations of Computer Science Foundations of computer science Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on. :81-90 2004

Relation: Proceedings. 45th Annual IEEE Symposium on Foundations of Computer Science

المؤلفون: Chuzhoy, J., Naor, J.S.

المصدر: The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. Foundations of computer science Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE Symposium on. :481-489 2002

Relation: Proceedings of 43rd Annual IEEE Symposium on Foundations of Computer Science

المؤلفون: Chuzhoy, J., Ostrovsky, R.

المصدر: Proceedings 42nd IEEE Symposium on Foundations of Computer Science Cluster Computing, 2001. Proceedings. 2001 IEEE International Conference on. :348-356 2001

Relation: Proceedings 42nd IEEE Symposium on Foundations of Computer Science

المؤلفون: Chekuri, C., Chuzhoy, J., Lewin-Eytan, L., Naor, J., Orda, A.

المصدر: IEEE Journal on Selected Areas in Communications IEEE J. Select. Areas Commun. Selected Areas in Communications, IEEE Journal on. 25(6):1193-1206 Aug, 2007

المؤلفون: Chuzhoy, J., Gao, Y., Li, J., Na Nongkai, Danupon, 1981, Peng, R., Saranurak, T.

المصدر: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. :1158-1167

مصطلحات موضوعية: balanced cuts, deterministic algorithms, dynamic connectivity, Laplacian solvers, maximum flow, Approximation algorithms, Flow graphs, Dynamic graph algorithms, Linear-time approximation, Minimizing the number of, Minimum spanning forests, Randomized Algorithms, Time complexity, Undirected graph, Graph algorithms

وصف الملف: print

URL الوصول: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-292665

لا يتم عرض هذه النتيجة على الضيوف.
تسجيل الدخول للوصول الكامل.

لا يتم عرض هذه النتيجة على الضيوف.
تسجيل الدخول للوصول الكامل.

لا يتم عرض هذه النتيجة على الضيوف.
تسجيل الدخول للوصول الكامل.