A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games

DOI10.1016/j.disopt.2012.10.004zbMath1258.91017OpenAlexW1996961942MaRDI QIDQ1941537

V. Leoni, Maria Patricia Dobson, Graciela L. Nasini

Publication date: 13 March 2013

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2012.10.004

zbMATH Keywords

graphNP-completenesstotally balanced gameedge-perfect

Mathematics Subject Classification ID

Noncooperative games (91A10) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (2)

Forbidden subgraphs and the König-Egerváry property ⋮ On the population monotonicity of independent set games

This page was built for publication: A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games