4 citations · 7 across the 6 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013★ 1 cited
On the Independent Set and Common Subgraph Problems in Random Graphs
Yinglei Song
In this paper, we develop efficient exact and approximate algorithms for computing a maximum independent set in random graphs. In a random graph , each pair of vertices are join…
cs.DS2013
An Improved Parameterized Algorithm for the Independent Feedback Vertex Set Problem
Yinglei Song
In this paper, we develop a new parameterized algorithm for the {\sc Independent Feedback Vertex Set} (IFVS) problem. Given a graph , the goal of the problem is to determi…