Browsing Faculty of Mathematics and Natural Sciences by Subject "Exact algorithms"
Now showing items 12 of 2

A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
(Springer, 20110121)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 ...Peer reviewedJournal article 
Solving the 2disjoint connected subgraphs problem faster than 2ⁿ
(Springer, 201410)The 2DISJOINT CONNECTED SUBGRAPHS problem, given a graph along with two disjoint sets of terminals Z1,Z2, asks whether it is possible to find disjoint sets A1,A2, such that Z1 ⊆ A1, Z2 ⊆ A2 and A1,A2 induce connected ...Journal article