A.M.H. Gerards and F.B. Shepherd. The characterization of graphs with all subgraphs t-perfect. Technical report, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Connections Between Semidefinite Relaxations of the.. - Laurent, Poljak, Rendl (1995) (15 citations) (Correct)
....the convex hull of the set of feasible solutions to the program (3. 4) The polytope ODD(G) in n is a relaxation of the stable set polytope, i.e. STAB(G) ODD(G) When STAB(G) ODD(G) the graph G is said to be t perfect (for recent progress on the characterization of t perfect graphs, see [GS95]) The set TH(G) is a positive semidefinite relaxation of the stable set polytope, i.e. STAB(G) TH(G) Indeed, if d 2 f0; 1g n is the incidence vector of a stable set of G and u : 1; d) 2 n 1 , then the matrix P : uu t satisfies (2.7) this shows that d belongs to TH(G) This ....
A.M.H. Gerards and F.B. Shepherd. The characterization of graphs with all subgraphs t-perfect. Technical report, 1995.
Polyhedral Techniques in Combinatorial Optimization I: Theory - Aardal, van Hoesel (1995) (1 citation) (Correct)
No context found.
A.M.H. Gerards and F.B. Shepherd (1995) "Characterization of the graphs with all subgraphs t-perfect" (in preparation).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC