Some news about the independence number of a graph

@article{Harant2000SomeNA,
  title={Some news about the independence number of a graph},
  author={Jochen Harant},
  journal={Discuss. Math. Graph Theory},
  year={2000},
  volume={20},
  pages={71-79}
}
  • J. Harant
  • Published 2000
  • Mathematics
  • Discuss. Math. Graph Theory
For a finite undirected graph G on n vertices some continuous optimization problems taken over the n-dimensional cube are presented and it is proved that their optimum values equal the independence number of G. 
On Domination in Graphs
TLDR
It is proved that their optimum values equal the domination number γ of G, and an efficient approximation method is developed and known upper bounds on γ are slightly improved.
On a Polynomial Fractional Formulation for Independence Number of a Graph
TLDR
Classical Karush-Kuhn-Tucker conditions and simple combinatorial arguments are found sufficient to deduce several interesting properties of the local and global maxima of a continuous global optimization formulation for finding the independence number of a graph.
Clique , independent set , and graph coloring
This article introduces the closely related maximum clique, maximum independent set, graph coloring, and minimum clique partitioning problems. The survey includes some of the most important results
A Heuristic for the Maximum Independent Set Problem Based on Optimization of a Quadratic Over a Sphere
TLDR
A heuristic for the maximum independent set problem is proposed which utilizes classical results for the problem of optimization of a quadratic function over a sphere and its efficiency is confirmed by results of numerical experiments on DIMACS benchmarks.
Maximum Clique, Maximum Independent Set, and Graph Coloring Problems
This article introduces the closely related maximum clique, maximum independent set, graph coloring, and minimum clique partitioning problems. The survey includes some of the most important results
Finding independent sets in a graph using continuous multivariable polynomial formulations
TLDR
This work proposes two polynomial-time algorithms, based on two continuous formulations of the maximum independent set problem on a graph G=(V,E), for finding maximal independent sets with cardinality greater than or equal to F( x0) and H(x0), respectively.
Finding the Maximal Independent Sets of a Graph Including the Maximum Using a Multivariable Continuous Polynomial Objective Optimization Formulation
TLDR
This work proposes a multivariable continuous polynomial optimization formulation to find arbitrary maximal independent sets of any size for any graph and believes that this algorithm is efficient for sparse graphs, for which there exist fast algorithms to list their maximal cliques.
Constructing test functions for global optimization using continuous formulations of graph problems
TLDR
A method for constructing test functions for global optimization which utilizes continuous formulations of combinatorial optimization problems is suggested, and a number of sample test functions based on these formulations are proposed.
On characterization of maximal independent sets via quadratic optimization
TLDR
Theoretical results characterizing binary local maxima in terms of certain induced subgraphs of the given graph are developed and these results are used to develop an efficient local search algorithm that provides considerable speed-up over a typical local search algorithms for the binary Hamming distance-2 neighborhood.
...
...

References

SHOWING 1-10 OF 24 REFERENCES
A lower bound on the independence number of a graph
  • J. Harant
  • Mathematics, Computer Science
    Discret. Math.
  • 1998
On the Independence Number of a Graph in Terms of N and M
For the independence number (G) of a connected graph G on n vertices with m edges the inequality (G) 1 2 (2m + n + 1) ? p (2m + n + 1) 2 ? 4n 2 ] is proved and its algorithmic realization is
On the independence number of a graph in terms of order and size
A Probabilistic lower bound on the independence number of graphs
  • S. Selkow
  • Mathematics, Computer Science
    Discret. Math.
  • 1994
A note on the independence number of triangle-free graphs
Independence, clique size and maximum degree
It was shown before that ifG is a graph of maximum degreep containing no cliques of the sizeq then the independence ratio is greater than or equal to 2 / (p +q). We shall discuss here some extreme
The independence number of graphs in terms of degrees
  • S. Selkow
  • Mathematics, Computer Science
    Discret. Math.
  • 1993
Maxima for Graphs and a New Proof of a Theorem of Turán
Maximum of a square-free quadratic form on a simplex. The following question was suggested by a problem of J. E. MacDonald Jr. (1): Given a graph G with vertices 1, 2, . . . , n. Let S be the simplex
A note on the independence number of triangle-free graphs, II
Approximating Maximum Independent Sets by Excluding Subgraphs
TLDR
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.
...
...