Selected article for: "edge node and graph edge node"

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_75
    Snippet: . CC-BY-NC-ND 4.0 International license author/funder. It is made available under a The copyright holder for this preprint (which was not peer-reviewed) is the . https://doi.org/10.1101/842740 doi: bioRxiv preprint Corollary 1. The Multicolored Subgraph problem is NP-complete, even for a complete assignment graph, binary edge weights and zero node weights......
    Document: . CC-BY-NC-ND 4.0 International license author/funder. It is made available under a The copyright holder for this preprint (which was not peer-reviewed) is the . https://doi.org/10.1101/842740 doi: bioRxiv preprint Corollary 1. The Multicolored Subgraph problem is NP-complete, even for a complete assignment graph, binary edge weights and zero node weights.

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