Connected tropical subgraphs in vertex-colored graphs

HIGHLIGHTS

  • who: DMTCS vol. and collaborators from the LRI., Université Paris-Sud, France. Mathematical Institute, University of Toulouse III (Paul Sabatier), France. have published the research work: Connected Tropical Subgraphs in Vertex-Colored Graphs, in the Journal: (JOURNAL)
  • what: The authors show that a polynomial algorithm for MCTS on split graphs can be used to solve V ERTEX C OVER on all graphs. The authors show that a bijection exists between the set of minimum c connected tropical subgraphs of SG and the set of optimal solutions to V ERTEX C OVER in G. c Let . . .

     

    Logo ScioWire Beta black

    If you want to have access to all the content you need to log in!

    Thanks :)

    If you don't have an account, you can create one here.

     

Scroll to Top

Add A Knowledge Base Question !

+ = Verify Human or Spambot ?