Author: Marcus Ludwig; Louis-Félix Nothias; Kai Dührkop; Irina Koester; Markus Fleischauer; Martin A. Hoffmann; Daniel Petras; Fernando Vargas; Mustafa Morsy; Lihini Aluwihare; Pieter C. Dorrestein; Sebastian Böcker
Title: ZODIAC: database-independent molecular formula annotation using Gibbs sampling reveals unknown small molecules Document date: 2019_11_16
ID: 03uonbrv_67
Snippet: Maximum Multicolored Subgraph problem. We are given a graph G = (V, E), a node coloring c : V → C and weights w : V ∪ E → R. We search for an assignment A ⊆ V of maximum weight, that is, a node-induced multicolored subgraph of maximum weight......
Document: Maximum Multicolored Subgraph problem. We are given a graph G = (V, E), a node coloring c : V → C and weights w : V ∪ E → R. We search for an assignment A ⊆ V of maximum weight, that is, a node-induced multicolored subgraph of maximum weight.
Search related documents:
Co phrase search for related documents, hyperlinks ordered by date