Blar i Department of Informatics på emneord "Graphs"
Viser treff 1-2 av 2
-
Kernelization for Balanced Graph Clustering
(Master thesis, 2020-10-03)The problems of Balanced Graph Clustering ask whether it is possible to modify a graph such that it becomes a cluster graph where no cluster has a size larger than a given multiplicative factor or absolute difference ... -
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
(Peer reviewed; Journal article, 2011-01-21)In this note, we give a proof that several vertex ordering problems can be solved in O ∗(2 n ) time and O ∗(2 n ) space, or in O ∗(4 n ) time and polynomial space. The algorithms generalize algorithms for the Travelling ...