PEWARNAAN GRAF UNTUK MENENTUKAN DISTRIBUSI ANGKLUNG
The problem of angklung distribution and its variations are common problems faced by every angklung ensemble team while preparing a performance. The use of common distribution methods such as tonjur often does not give any solution of many variations of angklung distribution problem. The variatio...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Subjects: | |
| Online Access: | https://digilib.itb.ac.id/gdl/view/54747 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | The problem of angklung distribution and its variations are common problems
faced by every angklung ensemble team while preparing a performance. The use
of common distribution methods such as tonjur often does not give any solution of
many variations of angklung distribution problem. The variations may include the
weighted distribution problem, which is the problem of distributing angklung by
considering the maximum weight allowed for each player with respect to some
aspects of the angklung, and critical distribution problem, which is the problem of
distributing angklung when the number of available player is less than the
minimum number of player needed to play a song. The former problem is solved
by generating a vertex-weighted graph associated with the song where its vertex
set is the angklungs, its weight set is the angklung’s aspects, and an edge connects
two angklungs if both angklungs are overlapping. The graph is then coloured
using any reasonably good algorithm. The latter problem is solved by constructing
an array associated with the song before redefining what it means when two
angklungs are overlapping. By applying colouring algorithm, the solution
guarantees that the song can be played by less number of player if some
conditions are met. |
|---|