The travelling preacher, projection, and a lower bound for the stability number of a graph

The travelling preacher, projection, and a lower bound for the stability number of a graph

0.00 Avg rating0 Votes
Article ID: iaor20091414
Country: Netherlands
Volume: 5
Issue: 2
Start Page Number: 290
End Page Number: 292
Publication Date: May 2008
Journal: Discrete Optimization
Authors: ,
Keywords: networks
Abstract:

The coflow min–max equality is given a travelling preacher interpretation, and is applied to give a lower bound on the maximum size of a set of vertices, no two of which are joined by an edge.

Reviews

Required fields are marked *. Your email address will not be published.