no help available
no help available
tagThe blue social bookmark and publication sharing system.
actions for all displayed bookmarks:
export:
sort:
- criterion: date, title
- order: ascending, descending
others:
- display: all, bookmarks only
- bookmarks per page: 5 10 20 50 100
bookmarks (4)
actions for all displayed publications:
export:
sort:
- criterion: date, title
- order: ascending, descending
- advanced...
others:
- display: all, publications only
- publications per page: 5 10 20 50 100
publications (28)
- browse
- related tags
- similar tags
- METIS is a family of programs for partitioning unstructured graphs and hypergraphs and computing fill-reducing orderings of sparse matrices. The underlying algorithms used by METIS are based on the state-of-the-art multilevel paradigm that has been shown to produce high quality results and scale to very large problems. · http://glaros.dtc.umn.edu/gkhome/views/metisMETIS is a family of programs for partitioning unstructured graphs and hypergraphs and computing fill-reducing orderings of sparse matrices. The underlying algorithms used by METIS are based on the state-of-the-art multilevel paradigm that has been shown to produce high quality results and scale to very large problems. · http://glaros.dtc.umn.edu/gkhome/views/metis5 years and 4 months agoby mginf2
- Dajie Liu, Norbert Blenn, and Piet Van Mieghem. CoRR (2010)Dajie Liu, Norbert Blenn, and Piet Van Mieghem. CoRR (2010)2 months and 5 days agoby midein2
- Cyril A. Pshenichny, and Dmity Mouromtsev. Proceedings of the 21th International Conference on Conceptual Structures ICCS 2013, volume 7735 of Lecture Notes in Computer Science, page 289-300. Springer, (2013)Cyril A. Pshenichny, and Dmity Mouromtsev. Proceedings of the 21th International Conference on Conceptual Structures ICCS 2013, volume 7735 of Lecture Notes in Computer Science, page 289-300. Springer, (2013)2 months and 22 days agoby iccs2
- G. Khanna, N. Vydyanathan, T. Kurc, U. Catalyurek, P. Wyckoff, J. Saltz, and P. Sadayappan. Cluster Computing and the Grid, 2005. CCGrid 2005. IEEE International Symposium on, 2, page 792--799. IEEE, (2005)G. Khanna, N. Vydyanathan, T. Kurc, U. Catalyurek, P. Wyckoff, J. Saltz, and P. Sadayappan. Cluster Computing and the Grid, 2005. CCGrid 2005. IEEE International Symposium on, 2, page 792--799. IEEE, (2005)5 months and 9 days agoby ytyoun1
- Arash Asadpour, Uriel Feige, and Amin Saberi. ACM Trans. Algorithms 8(3):24:1--24:9 (July 2012)Arash Asadpour, Uriel Feige, and Amin Saberi. ACM Trans. Algorithms 8(3):24:1--24:9 (July 2012)8 months agoby ytyoun2
- Artur Czumaj, and Christian Scheideler. Random Struct. Algorithms 17(3-4):213-237 (2000)Artur Czumaj, and Christian Scheideler. Random Struct. Algorithms 17(3-4):213-237 (2000)a year and 3 months agoby ytyoun2
- Vinko Zlatic, Gourab Ghoshal, and Guido Caldarelli. (2009)cite arxiv:0905.0976Comment: 8 pages, 9 figures, revtex.Vinko Zlatic, Gourab Ghoshal, and Guido Caldarelli. (2009)cite arxiv:0905.0976Comment: 8 pages, 9 figures, revtex.a year and 7 months agoby dbenz2
- Xin Liu, and Tsuyoshi Murata. (2010)cite arxiv:1011.1043Comment: 4 pages, 3 figures.Xin Liu, and Tsuyoshi Murata. (2010)cite arxiv:1011.1043Comment: 4 pages, 3 figures.a year and 9 months agoby folke2
- A. Vazquez. Physical Review E 77(6):066106 (2008)A. Vazquez. Physical Review E 77(6):066106 (2008)a year and 9 months agoby folke1
- Gourab Ghoshal, Vinko Zlatic, Guido Caldarelli, and M. E. J. Newman. (2009)cite arxiv:0903.0419Comment: 11 pages, 7 figures.Gourab Ghoshal, Vinko Zlatic, Guido Caldarelli, and M. E. J. Newman. (2009)cite arxiv:0903.0419Comment: 11 pages, 7 figures.2 years and 4 months agoby dbenz2
- Beate Krause, Robert Jäschke, Andreas Hotho, and Gerd Stumme. HT '08: Proceedings of the Nineteenth ACM Conference on Hypertext and Hypermedia, page 157-166. New York, NY, USA, ACM, (2008)Beate Krause, Robert Jäschke, Andreas Hotho, and Gerd Stumme. HT '08: Proceedings of the Nineteenth ACM Conference on Hypertext and Hypermedia, page 157-166. New York, NY, USA, ACM, (2008)3 years agoby dipan10020
- R. Lambiotte, and M. Ausloos. (2005)cite arxiv:cs.DS/0512090.R. Lambiotte, and M. Ausloos. (2005)cite arxiv:cs.DS/0512090.3 years and 2 months agoby sdo24
- R. Lambiotte, and M. Ausloos. (2005)cite arxiv:cs.DS/0512090.R. Lambiotte, and M. Ausloos. (2005)cite arxiv:cs.DS/0512090.3 years and 4 months agoby hotho24
- George Karypis, and Vipin Kumar. In Proceedings of the Design and Automation Conference, page 343--348. (1998)George Karypis, and Vipin Kumar. In Proceedings of the Design and Automation Conference, page 343--348. (1998)3 years and 11 months agoby folke1
- G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar. (1997)G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar. (1997)3 years and 11 months agoby folke2
- D.A. Papa, and I.L. Markov. Handbook of Approximation Algorithms and Metaheuristics (2007)D.A. Papa, and I.L. Markov. Handbook of Approximation Algorithms and Metaheuristics (2007)3 years and 11 months agoby folke2
- Thomas Eiter, and Georg Gottlob. SIAM J. Comput. 24(6):1278--1304 (1995)Thomas Eiter, and Georg Gottlob. SIAM J. Comput. 24(6):1278--1304 (1995)4 years and 3 months agoby folke2
- J. H. Badsberg, and F. M. Malvestuto. Computational Statistics \& Data Analysis 37(3):297--322 (Sep 28, 2001)J. H. Badsberg, and F. M. Malvestuto. Computational Statistics \& Data Analysis 37(3):297--322 (Sep 28, 2001)5 years and a month agoby smicha1