Minimum Partition of an r−Independence System
Graph partitioning has been studied in the discipline between computer science and applied mathematics. It is a technique to distribute the whole graph data as a disjoint subset to a different device. The minimum graph partition problem with respect to an independence system of a graph has been stud...
Main Authors: | null Zill-e-Shams, Muhammad Salman, Zafar Ullah, Usman Ali |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2021-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2021/7163840 |
Similar Items
-
Minimum convex partitions of multidimensional polyhedrons
by: Ion Băţ
Published: (2007-11-01) -
Minimum convex partitions and maximum empty polytopes
by: Adrian Dumitrescu, et al.
Published: (2014-05-01) -
Inapproximability of the Minimum Biclique Edge Partition Problem
by: HIRATA, Tomio, et al.
Published: (2010) -
The incidence of alternative minimum load values in masonry partition and lightweight partition systems with a cost analysis in Barranquilla, Colombia
by: Marian Sabău, et al.
Published: (2018-12-01) -
Bounds for partition dimension of M-wheels
by: Hussain Zafar, et al.
Published: (2019-07-01)