The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems

DOI10.1016/j.endm.2010.05.070zbMath1237.90271OpenAlexW1981370779MaRDI QIDQ2883612

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

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.070

zbMATH Keywords

computational complexitygraph theorytotally balanced packing games

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Forbidden subgraphs and the Kőnig property

Cites Work

• Unnamed Item
• Unnamed Item
• Totally balanced combinatorial optimization games
• Recognizing Berge graphs
• Combinatorial Optimization
• Algorithmic Aspects of the Core of Combinatorial Optimization Games

This page was built for publication: The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems