On the Linear Extension Complexity of Stable Set Polytopes for Perfect Graphs

European Journal of Combinatorics - United States
doi 10.1016/j.ejc.2018.02.014
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

The Complexity of Dissociation Set Problems in Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2011English

Critical Chromatic Number and the Complexity of Perfect Packings in Graphs

2006English

Clique Family Inequalities for the Stable Set Polytope of Quasi-Line Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2003English

Extension Error Set Based on Extension Set

Applied Mathematics
2013English

Optimal Bound on the Combinatorial Complexity of Approximating Polytopes

2020English

Linear Kernels for (Connected) Dominating Set onH-minor-free Graphs

2012English

Polynomial Algorithms for Perfect Graphs

North-Holland Mathematics Studies
1984English

On the Spectral Set of a Linear Discrete System With Stable Lyapunov Exponents

Vestnik Udmurtskogo Universiteta: Matematika, Mekhanika, Komp'yuternye Nauki
Transfer ProcessesMathematicsFluid FlowComputer Science
2016English

Technical Note—Statistical Measures for Linear Functions on Polytopes

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1976English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy