Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 1 of 1 for “"very cost effective partition"”.
-
Very Cost Effective Partitions in Graphs
… set of vertices S, a vertex v in S is said to be very cost effective if it is adjacent to more vertices in V -S than in S.</p> <p>A bipartition pi={S, V- S} is called very cost effective if both S and V- S are very cost effective sets. Not all graphs have a very cost effective bipartition, for …