Now showing items 1-7 of 7
Fast Method for Maximum-Flow Problem with Minimum-Lot Sizes
(The University of Bergen, 2015-03-03)
In transportation networks, such as pipeline networks for transporting natural gas, it is often impractical to send across amounts of flow below a certain threshold. Such lower threshold is referred as the minimum-lot size. ...
Scaling the scales - A suggested improvement to IBM's Intelligent Recommendation Algorithm
(The University of Bergen, 2014-11-20)
Recommender systems appear in a large variety of applications, and their use has become very common in recent years. As a lot of money can be made by companies having a better recommender system than their competitors, ...
Community Detection in Social Networks
(The University of Bergen, 2015-05-01)
Social networks usually display a hierarchy of communities and it is the task of community detection algorithms to detect these communities and preferably also their hierarchical relationships. One common class of ...
A Survey of Linear-Programming Guided Branching Parameterized Algorithms for Vertex Cover, with Experimental Results
(The University of Bergen, 2015-06-01)
A survey of FPT algorithms for Vertex Cover, parameterized by an above guarantee parameter.
Maximum number of objects in graph classes.
(The University of Bergen, 2015-05-31)
The focus of this thesis is the study and implementation of two exact exponential time algorihms. These algorihms finds and lists the number of minimal dominating sets and the number of minimal subset feedback vertex ...
Independent Set on P5-free graphs, an empirical study
(The University of Bergen, 2015-11-20)
We implement the recent polynomial time algorithm for the independent set problem on P5-free graphs, and study the performance of this algorithm on graphs of size up to 50. Our empirical results show that the algorithm ...
A 43k Kernel for Planar Dominating Set using Computer-Aided Reduction Rule Discovery
(The University of Bergen, 2016-02-15)
In this thesis we explore the technique of Region Decomposition for finding kernels for Planar Dominating Set. We redefine some concepts used in earlier work, fixing some ambiguities on the way. From those concepts we ...