114 citations · 264 across the 42 of their papers we have counts for
Showing 2017 · math.COShow all
2 papers · 2 filters
math.CO2017
On the Linear Extension Complexity of Stable Set Polytopes for Perfect Graphs
Hao Hu, Monique Laurent
We study the linear extension complexity of stable set polytopes of perfect graphs. We make use of known structural results permitting to decompose perfect graphs into basic perfec…
math.CO2017★ 1 cited
Perfect Elimination Orderings for Symmetric Matrices
Monique Laurent, Shin-ichi Tanigawa
We introduce a new class of structured symmetric matrices by extending the notion of perfect elimination ordering from graphs to weighted graphs or matrices. This offers a common f…