21 citations · 64 across the 26 of their papers we have counts for
Showing 2012 · cs.DSShow all
2 papers · 2 filters
cs.DS2012★ 3 cited
Single Exponential FPT Algorithm for Interval Vertex Deletion and Interval Completion Problem
Arash Rafiey
Let G be an input graph with n vertices and m edges and let k be a fixed parameter. We provide a single exponential FPT algorithm with running time O(c^kn(n+m)), c= min {18,k} that…
cs.DS2012
Recognizing Interval Bigraphs by Forbidden Patterns
Arash Rafiey
Let H be a connected bipartite graph with n nodes and m edges. We give an O(nm) time algorithm to decide whether H is an interval bigraph. The best known algorithm has time complex…