An Algorithm for Partitioning the Nodes of a Graph
- 1 December 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 3 (4), 541-550
- https://doi.org/10.1137/0603056
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Lower Bounds for the Partitioning of GraphsIBM Journal of Research and Development, 1973
- A Heuristic Procedure for the Partitioning and Mapping of Computer Logic GraphsIEEE Transactions on Computers, 1971
- Virtual MemoryACM Computing Surveys, 1970
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970
- The variation of the spectrum of a normal matrixDuke Mathematical Journal, 1953