IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-030-18500-8_31.html
   My bibliography  Save this book chapter

Minimum Dominating Set and Maximum Independent Set for Evaluation of EU Funding Polices in Collaboration Networks

In: Operations Research Proceedings 2018

Author

Listed:
  • Valentin Bouquet

    (Université Paris-Nanterre)

  • Kymble Christophe

    (Université Paris-Nanterre
    Economix UMR 7235
    FRS Consulting)

  • François Delbot

    (Université Paris-Nanterre)

  • Gaétan Le Chat

    (FRS Consulting)

  • Jean-François Pradat-Peyre

    (Université Paris-Nanterre)

Abstract

Stimulating innovation and growth within the European Union is crucial and can be achieved by fostering R&D partnerships with EU Foreign Policies. Research collaboration networks induced by these policies received strong attention from policymakers. In this paper, we show that some structures from graph theory (such as Minimum Dominating Set) can be used to determine which members are most involved in these collaborative networks. Although these networks are large in size, it is possible to determine optimal MDS. In particular, we show that some vertices are present in any optimal solution. We call them persistent vertices. They provide a better understanding of the impact of EUFP on collaborations induced between companies or research organizations.

Suggested Citation

  • Valentin Bouquet & Kymble Christophe & François Delbot & Gaétan Le Chat & Jean-François Pradat-Peyre, 2019. "Minimum Dominating Set and Maximum Independent Set for Evaluation of EU Funding Polices in Collaboration Networks," Operations Research Proceedings, in: Bernard Fortz & Martine Labbé (ed.), Operations Research Proceedings 2018, pages 243-249, Springer.
    • Handle: RePEc:spr:oprchp:978-3-030-18500-8_31
    DOI: 10.1007/978-3-030-18500-8_31
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-030-18500-8_31. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.