diplomsko delo
Sergej Munda (Author), Jurij Mihelič (Mentor), Miha Moškon (Co-mentor)

Abstract

Pri posedanju učencev v šolske klopi, organizaciji tekmovanj iz znanja, organizaciji poroke in pri drugih podobnih dogodkih se srečamo s problemom razmestitve. Gre za enega od tistih problemov, ki so na začetku videti trivialni, saj so pravila posedanja po navadi preprosta in razumljiva. Zaradi tega se organizatorji zgoraj navedenih dogodkov velikokrat odločijo za izdelavo sedežnega reda na roke, kar hitro postane eno najbolj zamudnih del organizatorja. V okviru diplomske naloge je bil problem razmestitve natančno opredeljen, dokazano je bilo, da je problem NP-poln in izdelana je bila spletna aplikacija za samodejno izdelavo sedežnih redov. Poleg samodejne izdelave sedežnega reda aplikacija ponuja tudi uporabniške vmesnike za vnos podatkov o osebah, izdelavo topologije sedežnih mest in prikaz končne razmestitve.

Keywords

problematika razmestitve;sedežni red;podgrafni izomorfizem;računalništvo in informatika;univerzitetni študij;diplomske naloge;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UL FRI - Faculty of Computer and Information Science
Publisher: [S. Munda]
UDC: 004.774.6(043.2)
COBISS: 78211587 Link will open in a new window
Views: 260
Downloads: 69
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary title: Web application for automated creation of seating plans
Secondary abstract: We encounter the arrangement problem while making classroom seating plans, organizing knowledge competitions, organizing weddings and other similar events. This is one of those problems that seem trivial at first, because the rules of creating a seating plan are usually simple and understandable. As a result, the organizers of the above-mentioned events often decide to create a seating plan by hand, which becomes one of the most time-consuming tasks of the organizers. In this thesis, we defined the arrangement problem and proved it to be NP-complete. Furthermore, we created a web application that allows its users an automatic creation of seating plans. In addition to the automatic creation of seating plans, the application also includes user interfaces for entering the data of the seated persons, for creating seat topologies and for displaying the final seating plan.
Secondary keywords: web application;arrangement problem;seating plan;subgraph isomorphism;computer science;computer and information science;diploma;Spletne aplikacije;Računalništvo;Univerzitetna in visokošolska dela;
Type (COBISS): Bachelor thesis/paper
Study programme: 1000468
Thesis comment: Univ. v Ljubljani, Fak. za računalništvo in informatiko
Pages: 53 str.
ID: 13403709