Type Run Description MAP Official A UTen English ASR 0.0031 A UTt hs-t2-nm Top-2 concepts from t hs graph method with neighbor multiply 0.0137 A UTwiki-t2-nm Top-2 Wikipedia conc...
Robin Aly, Claudia Hauff, Willemijn Heeren, Djoerd...
Background: New systems biology studies require researchers to understand how interplay among myriads of biomolecular entities is orchestrated in order to achieve high-level cellu...
Tianxiao Huan, Andrey Y. Sivachenko, Scott H. Harr...
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current...
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...