The complexity of counting surjective homomorphisms and compactions
From MaRDI portal
Publication:5232140
Recommendations
Cites work
- scientific article; zbMATH DE number 3758365 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1545676 (Why is no real title available?)
- scientific article; zbMATH DE number 2151250 (Why is no real title available?)
- scientific article; zbMATH DE number 2151253 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results
- Algorithms for partition of some class of graphs under compaction and vertex-compaction
- Approximately counting \(H\)-colorings is \(\#\)BIS-hard
- Compaction, Retraction, and Constraint Satisfaction
- Computational Complexity of Compaction to Reflexive Cycles
- Computational complexity of compaction to irreflexive cycles
- Computing vertex-surjective homomorphisms to partially reflexive trees
- Counting graph homomorphisms
- Finding vertex-surjective graph homomorphisms
- Graph homomorphisms and phase transitions
- Homomorphisms are a good basis for counting small subgraphs
- Homomorphisms of graphs and of their orientations
- Large networks and graph limits
- Left and right convergence of graphs with bounded degree
- List homomorphisms and circular arc graphs
- List homomorphisms to reflexive graphs
- On the complexity of H-coloring
- Operations with structures
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Retractions to Pseudoforests
- Surjective \(H\)-colouring: new hardness results
- The complexity of surjective homomorphism problems-a survey
- The computational complexity of disconnected cut and \(2 K_2\)-partition
- The relative complexity of approximate counting problems
Cited in
(5)- scientific article; zbMATH DE number 769607 (Why is no real title available?)
- The complexity of surjective homomorphism problems-a survey
- Algebraic global gadgetry for surjective constraint satisfaction
- The complexity of counting surjective homomorphisms and compactions
- The complexity of locally injective homomorphisms
This page was built for publication: The complexity of counting surjective homomorphisms and compactions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232140)
