Maximally Balanced Connected Partition Problem in Graphs: Application in Education
The Teaching of Mathematics, XV (2012) no. 2, p. 121
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
This paper presents the maximally balanced connected partition (MBCP) problem in graphs. MBCP is to partition a weighted connected graph into the two connected subgraphs with minimal misbalance, i.e., the sums of vertex weights in two subgraphs are as much equal as possible. The MBCP has many applications both in science and practice, including education. As an illustration of the application of MBCP, a concrete example of organizing the course Selected Topics of Number Theory is analyzed and one balanced partition is suggested. Several algorithms for solving this NP hard problem are also studied.
Classification :
1AMS97N60 2MESCN64
Keywords: Graph partitioning, computers in education, course organization.
Keywords: Graph partitioning, computers in education, course organization.
@article{TM2_2012_XV_2_a3,
author = {Dragan Mati\'c and Milan Bo\v{z}i\'c},
title = {Maximally {Balanced} {Connected} {Partition} {Problem} in {Graphs:} {Application} in {Education}},
journal = {The Teaching of Mathematics},
pages = {121 },
year = {2012},
volume = {XV},
number = {2},
language = {en},
url = {http://geodesic.mathdoc.fr/item/TM2_2012_XV_2_a3/}
}
Dragan Matić; Milan Božić. Maximally Balanced Connected Partition Problem in Graphs: Application in Education. The Teaching of Mathematics, XV (2012) no. 2, p. 121 . http://geodesic.mathdoc.fr/item/TM2_2012_XV_2_a3/