METIS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices
- Hardware and Architecture
- Electrical and Electronic Engineering
- Computer Networks and Communications
- Authors
- George KarypisVipin Kumar
- Journal
- University of Minnesota Digital Conservancy (University of Minnesota)
In The Last Decade
doi.org/w41953197 →Countries where authors are citing METIS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices
This map shows the geographic impact of METIS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by METIS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites METIS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices more than expected).
Fields of papers citing METIS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices
This network shows the impact of METIS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the METIS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices.
About METIS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices
This paper, published in 1997, received 779 indexed citations . Written by George Karypis and Vipin Kumar covering the research area of Hardware and Architecture, Electrical and Electronic Engineering and Computer Networks and Communications. It is primarily cited by scholars working on Computational Mechanics (254 citations), Electrical and Electronic Engineering (188 citations) and Computer Networks and Communications (170 citations). Published in University of Minnesota Digital Conservancy (University of Minnesota).
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.
This paper is also available at doi.org/w41953197.