C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
On the linear extension complexity of stable set polytopes for perfect graphs.
Hao Hu
Monique Laurent
Published in:
Eur. J. Comb. (2019)
Keyphrases
</>
stable set
linear complexity
series parallel
maximum matching
worst case
directed graph
graph matching
graph theoretic