Can I read The Performance of an Eigenvalue Bound on the Max-cut Problem in Some Classes of Graphs on EtoBox?

The Performance of an Eigenvalue Bound on the Max-cut Problem in Some Classes of Graphs by C. Delorme; S. Poljak is a Computer Science article available to read on EtoBox.

What is The Performance of an Eigenvalue Bound on the Max-cut Problem in Some Classes of Graphs about?

Delorme, C. and S. Poljak, The performance of an eigenvalue bound on the max-cut problem in some classes of graphs, Discrete Mathematics 111 (1993) 145-156. The authors earlier introduced a number q(C), which gives a well-computable upper bound on the maximum bipartite subgraph of a graph or, more generally, on the maximum cut of a weighted graph. In this paper we study the performance of this bound on a large variety of examples from the graph theory. We also present an alternative definition of v(C) using a graph operation of vertex-splitting. Finally, we present the results of some preliminary computational experiments on randomly generated graphs.

Who reads The Performance of an Eigenvalue Bound on the Max-cut Problem in Some Classes of Graphs?

Author

C. Delorme; S. Poljak

Publisher

Elsevier Science; Elsevier ; Elsevier BV (ISSN 0012-365X)

Published

1993

Language

EN

Field

Computer Science (Physical Sciences)