Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

4

ARSCOM
1999

favoriteEmaildiscussreport

57views more ARSCOM 1999»

Minimal Partitions of a Graph

13 years 4 months ago

Minimal Partitions of a Graph

Download www.math.siu.edu

For a given graph G, we fix s, and partition the vertex set into s classes, so that any given class contains few edges. The result gives a partition (U1,

Thomas Dale Porter

Real-time Traffic

ARSCOM 1999 |

claim paper

Related Content

» Coclustering Documents and Words by Minimizing the Normalized Cut Objective Function

» Heterogeneous HardwareSoftware System Partitioning using Extended Directed Acyclic Graph

» Outerplanar Crossing Numbers of 3Row Meshes Halin Graphs and Complete pPartite Graphs

» Markov Random Field Energy Minimization via Iterated Cross Entropy with Partition Strategy

» Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems

» Decomposing Berge Graphs Containing No Proper Wheel Long Prism Or Their Complements

» Analysis and approximation for bank selection instruction minimization on partitioned memo...

» Factoring logic functions using graph partitioning

» Graph Partitioning Active Contours GPAC for Image Segmentation

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	ARSCOM
Authors	Thomas Dale Porter

Comments (0)