On the (Parameterized) Complexity of Recognizing Well-Covered $(r,l)$-graphs - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2016

On the (Parameterized) Complexity of Recognizing Well-Covered $(r,l)$-graphs

Dates and versions

lirmm-01481787 , version 1 (02-03-2017)

Identifiers

Cite

Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luerbio Faria, Sulamita Klein, Ignasi Sau, et al.. On the (Parameterized) Complexity of Recognizing Well-Covered $(r,l)$-graphs. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.423-437, ⟨10.1007/978-3-319-48749-6_31⟩. ⟨lirmm-01481787⟩
111 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More