首页 | 本学科首页   官方微博 | 高级检索  
     检索      


The travelling preacher, projection, and a lower bound for the stability number of a graph
Authors:Kathie Cameron  Jack Edmonds  
Institution:aWilfrid Laurier University, Waterloo, Ontario, Canada N2L 3C5;bEP Institute, Kitchener, Ontario, Canada N2M 2M6
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.
Keywords:Network flow  Circulation  Projection of a polyhedron  Gallai’s conjecture  Stable set  Total dual integrality  Travelling salesman cost allocation game
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号