The graph sandwich problem for 1-join composition is NP-complete

From MaRDI portal
Publication:1613390

DOI10.1016/S0166-218X(01)00246-3zbMath0995.05133WikidataQ59904349 ScholiaQ59904349MaRDI QIDQ1613390

Sulamita Klein, Kristina Vušković, Celina M. Herrera de Figueiredo

Publication date: 29 August 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)




Related Items (15)



Cites Work


This page was built for publication: The graph sandwich problem for 1-join composition is NP-complete