Selected article for: "edge node and Multicolored Subgraph problem"

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_72
    Snippet: Lemma 1. The Multicolored Subgraph problem is NP-complete, even for unit edge weights and zero node weights......
    Document: Lemma 1. The Multicolored Subgraph problem is NP-complete, even for unit edge weights and zero node weights.

    Search related documents:
    Co phrase search for related documents
    • edge weight and node weight: 1, 2, 3, 4, 5, 6
    • Multicolored Subgraph problem and node weight: 1, 2, 3