A New Heuristic for Partitioning the Nodes of a Graph
- 1 August 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 1 (3) , 299-305
- https://doi.org/10.1137/0401030
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- The indefinite zero-one quadratic problemDiscrete Applied Mathematics, 1984
- An Algorithm for Partitioning the Nodes of a GraphSIAM Journal on Algebraic Discrete Methods, 1982
- Optimal Decomposition of Large-Scale NetworksIEEE Transactions on Systems, Man, and Cybernetics, 1979
- A Heuristic Procedure for the Partitioning and Mapping of Computer Logic GraphsIEEE Transactions on Computers, 1971
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970