Cart (Loading....) | Create Account
Close category search window
 

Combinatorial Solution to the Partitioning of General Graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Lukes, J.A. ; IBM System Development Division Laboratory, 1512 Page Mill Rd., Palo Alto, California 94304, USA

This paper reviews a dynamic programming procedure for the partitioning of connected graphs with integer-weighted nodes and positive valued edges. The upper bound on the number of feasible partitions generated using this technique is shown to grow factorially in the number of graph nodes. The use of graph properties is then introduced to reduce the number of feasible partitions generated in the determination of the optimal partition. Depending upon the structure of the graph, the use of these properties can cause a significant reduction in the computation time and storage space required to partition the graph.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Journal of Research and Development  (Volume:19 ,  Issue: 2 )

Date of Publication:

March 1975

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.