[PDF][PDF] Restricted matchings
M Fürst - 2019 - oparu.uni-ulm.de
A matching in a graph G is a set of pairwise disjoint edges of G. The matching number of G is
defined as the maximum cardinality of a matching in G. In this thesis I will present several …
defined as the maximum cardinality of a matching in G. In this thesis I will present several …
A faster algorithm for maximum independent set on interval filament graphs
We provide an algorithm requiring only $ O (N^ 2) $ time to compute the maximum weight
independent set of interval filament graphs. This also implies an $ O (N^ 4) $ algorithm to …
independent set of interval filament graphs. This also implies an $ O (N^ 4) $ algorithm to …
Algorithms for Geometric Intersection Graphs
A Gozzard - 2023 - research-repository.uwa.edu.au
I present an overview of several problems in the field of intersection graphs of geometric
objects and my work on algorithms for solving these problems. These include polygon-circle …
objects and my work on algorithms for solving these problems. These include polygon-circle …
Algorithms for RNA structure and related graphs
M Ward-Graham - 2019 - research-repository.uwa.edu.au
This thesis comprises work on RNA secondary structure and related graphs. Novel
algorithms for predicting RNA secondary structures are presented. These algorithms …
algorithms for predicting RNA secondary structures are presented. These algorithms …