A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results

From MaRDI portal
Publication:2575831

DOI10.1016/j.jcss.2004.07.003zbMath1101.68613OpenAlexW2051028069MaRDI QIDQ2575831

Narayan Vikas

Publication date: 7 December 2005

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2004.07.003




Related Items (15)



Cites Work


This page was built for publication: A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results