For graphs G and H , a homomorphism from G to H is a function φ : V (G) → V (H), which maps vertices adjacent in G to adjacent vertices of H . A homomorphism is locally injective if no two vertices with a common neighbor are mapped to a single vertex in H . Many cases of graph homomorphism and locally injective graph homomorphism are NPcomplete, so there is little hope to design polynomial-time...

Quantum Monte Carlo calculations of the relaxation energy, pair-correlation function, and annihilating-pair momentum density are presented for a positron immersed in a homogeneous electron gas. We find smaller relaxation energies and contact pair-correlation functions in the important low-density regime than predicted by earlier studies. Our annihilating-pair momentum densities have almost zero...

Many exact search algorithms for NP-hard graph problems adopt the old Davis-Putman branch-and-reduce paradigm. The performance of these algorithms often suffers from the increasing number of graph modifications, such as vertex/edge deletions, that reduce the problem instance and have to be “taken back” frequently during the search process. We investigate practical implementation-based aspects o...

Recent PAMELA data show that positron fraction has an excess above several GeV while anti-proton one is not. Moreover ATIC data indicates that electron/positron flux have a bump from 300 GeV to 800 GeV. Both annihilating dark matter (DM) with large boost factor and decaying DM with the life around 1026s can account for the PAMELA and ATIC observations if their main final products are charged le...