Computational complexity relationship between compaction, vertex-compaction, and retraction

DOI10.1007/978-3-319-78825-8_13zbMath1410.68180OpenAlexW2799057365MaRDI QIDQ5915645

Narayan Vikas

Publication date: 15 June 2018

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-78825-8_13

zbMATH Keywords

partitionalgorithmscomputational complexitygraphretractioncolouringhomomorphismcompactionvertex-compaction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Computational complexity relationship between compaction, vertex-compaction, and retraction

This page was built for publication: Computational complexity relationship between compaction, vertex-compaction, and retraction