The complexity of approximately counting retractions

Let G be a graph that contains an induced subgraph H. A retraction from G to H is a homomorphism from G to H that is the identity function on H. Retractions are very well studied: Given H, the complexity of deciding whether there is a retraction from an input graph G to H is completely classified, i...

সম্পূর্ণ বিবরণ

গ্রন্থ-পঞ্জীর বিবরন
প্রধান লেখক: Focke, J, Goldberg, LA, Živný, S
বিন্যাস: Journal article
ভাষা:English
প্রকাশিত: Association for Computing Machinery 2020