Skip to main content

Research Repository

Advanced Search

Outputs (3162)

Query-driven Parallel Exploration of Large Datasets (2012)
Presentation / Conference Contribution
Atanasov, A., Srinivasan, M., & Weinzierl, T. (2012, October). Query-driven Parallel Exploration of Large Datasets. Presented at Large Data Analysis and Visualization (LDAV), 2012 IEEE Symposium on

Computing vertex-surjective homomorphisms to partially reflexive trees (2012)
Journal Article
Golovach, P., Paulusma, D., & Song, J. (2012). Computing vertex-surjective homomorphisms to partially reflexive trees. Theoretical Computer Science, 457, 86-100. https://doi.org/10.1016/j.tcs.2012.06.039

A homomorphism from a graph GG to a graph HH is a vertex mapping f:VG→VHf:VG→VH such that f(u)f(u) and f(v)f(v) form an edge in HH whenever uu and vv form an edge in GG. The HH-Coloring problem is that of testing whether a graph GG allows a homomorph... Read More about Computing vertex-surjective homomorphisms to partially reflexive trees.