On the diameter of the edge cover polytope
Reads0
Chats0
TLDR
Adjacency of edge covers on the edge cover polytope of a graph G = (V, E, E) is characterized, and it is derived that the diameter of the edgecoverPolytope is equal to |E| − ϱ(G), where ϱ (G) is the minimum size of an edge cover.About:
This article is published in Journal of Combinatorial Theory, Series B.The article was published on 1991-03-01 and is currently open access. It has received 9 citations till now. The article focuses on the topics: Edge cover & Adjacency list.read more
Citations
More filters
Book ChapterDOI
A Tutorial on Image Analysis
TL;DR: There is an expectation that technological advances should soon provide solutions to problems such as automatic face or hand recognition, or unsupervised robotic vision.
Journal ArticleDOI
Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives
TL;DR: This work suggests a general method to obtain pseudoapproximations for many interdiction problems, and presents a PTAS for interdicting b-stable sets in bipartite graphs that can handle submodular interdictions costs when the underlying problem is to find a maximum weight independent set in a matroid.
Proceedings ArticleDOI
Semi-automatic medical image segmentation with adaptive local statistics in Conditional Random Fields framework
TL;DR: A semi-automatic and accurate segmentation method by giving a user an intuitive graphical interface to indicate samples of target and non-target tissue by loosely drawing a few brush strokes on the image to provide the statistical input for a Conditional Random Field (CRF) based segmentation.
Proceedings ArticleDOI
The Diameter of the Fractional Matching Polytope and Its Hardness Implications
TL;DR: In this article, it was shown that the problem of computing the diameter of a polytope is strongly NP-hard even for a simple structure, namely, the fractional matching polytopes, and also that computing a pair of vertices at maximum shortest path distance on the 1-skeleton of this polytoope is an APX-hard problem.
References
Related Papers (5)
On the integral dicycle packings and covers and the linear ordering polytope
Zeev Nutov,Michal Penn +1 more