Blar i Faculty of Mathematics and Natural Sciences på emneord "graph editing"
Viser treff 1-2 av 2
-
Editing to Eulerian Graphs
(Journal article; Peer reviewed, 2014)We investigate the problem of modifying a graph into a connected graph in which the degree of each vertex satisfies a prescribed parity constraint. Let ea, ed and vd denote the operations edge addition, edge deletion and ... -
Fast biclustering by dual parameterization
(Peer reviewed; Journal article, 2015)We study two clustering problems, Starforest Editing, the problem of adding and deleting edges to obtain a disjoint union of stars, and the generalization Bicluster Editing. We show that, in addition to being NP-hard, none ...