On the independent set problem in random graphs

  title={On the independent set problem in random graphs},
  author={Yinglei Song},
  journal={International Journal of Computer Mathematics},
  pages={2233 - 2242}
  • Yinglei Song
  • Published 2015
  • Mathematics, Computer Science
  • International Journal of Computer Mathematics
In this paper, we develop efficient exact and approximate algorithms for computing a maximum independent set in random graphs. In a random graph G, each pair of vertices are joined by an edge with a probability p, where p is a constant between 0 and 1. We show that a maximum independent set in a random graph that contains n vertices can be computed in expected computation time . In addition, we show that, with high probability, the parameterized independent set problem is fixed parameter… Expand
3 Citations
On the Dominating Set Problem in Random Graphs
It is shown that, given a random graph in $n$ vertices, a minimum dominating set in the graph can be computed in expected $2^{O(\log_{2}^{2}{n})}$ time and the parameterized dominating set problem can be solved in expected £O(f(k)n^{c}) time when the probability of $p$ depends on $n and equals to $g(n)< n$. Expand
A new algorithm for preserving global and local structures in supervised dimensionality reduction
  • Yinglei Song, Junbu Wang, +4 authors Junfeng Qu
  • Computer Science
  • 2017 7th IEEE International Conference on Electronics Information and Emergency Communication (ICEIEC)
  • 2017
A new quadratic measure is developed to accurately describe the local features of a dataset and a composite objective is used to balance the global and local features in the dimensionality reduction of labeled datasets. Expand
Supervised dimensionality reduction that preserves both global and local information
Experiments on benchmark data sets show that both the global and local information in a dataset can be effectively captured by this approach and it is thus able to provide more accurate results for dimensionality reduction than some existing approaches. Expand


Finding a Maximum Independent Set in a Sparse Random Graph
A polynomial time algorithm is presented that with high probability (over the random choice of random graph $G$ and without being given the planted independent set $I) finds the maximum independent set in G when $c_0$ is some sufficiently large constant independent of $d$. Expand
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover
This paper transforms an essential part of the search process into the task of enumerating maximal independent sets in only a part of only one of the input graphs, made possible by exploiting an efficient decomposition of a graph into a minimum vertex cover and the maximum independent set in its complement. Expand
Approximation algorithms for combinatorial problems
For the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as 0(nε), where n is the problem size and ε> 0 depends on the algorithm. Expand
On the Performance of Polynomial-time CLIQUE Approximation Algorithms on Very Large Graphs
The performance of a randomized version of the subgraph-exclusion algorithm (called Ramsey) for CLIQUE by Boppana and Halld orsson is studied on very large graphs. We compare the performance of thisExpand
Approximating Maximum Clique by Removing Subgraphs
  • U. Feige
  • Mathematics, Computer Science
  • SIAM J. Discret. Math.
  • 2004
We show an algorithm that finds cliques of size (log n/log log n)2 whenever a graph has a clique of size at least n/(log n)b for an arbitrary constant b. This leads to an algorithm that approximatesExpand
Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem
In this work, the NP-hard maximum clique problem on graphs is considered and starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure that successfully solves the difficult Brockington-Culberson instances. Expand
Approximating Maximum Independent Sets by Excluding Subgraphs
An approximation algorithm for the maximum independent set problem is given, improving the best performance guarantee known to n/(log n)2, and this can be combined into a surprisingly strong simultaneous performance guarantee for the clique and coloring problems. Expand
An improved branch and bound algorithm for the maximum clique problem
A new algorithm for finding a maximum clique in an undirected graph is described. An approximate coloring algorithm has been improved and used to provide bounds to the size of the maximum clique in aExpand
Linear FPT reductions and computational lower bounds
It is proved that the NP-hard distinguishing substring selection problem has no polynomial time approximation schemes of running time f(1/ε)no(1 /ε) for any function f unless an unlikely collapse occurs in parameterized complexity theory. Expand
Strong computational lower bounds via parameterized complexity
It is proved that the NP-hard distinguishing substring selection problem has no polynomial time approximation schemes of running time f(1/@e)n^o^(^1^/^@e^) for any function f unless an unlikely collapse occurs in parameterized complexity theory. Expand