„maximum induced tree“

Suchergebnisse

4 Treffer

• Integer Programming Formulations and Cutting Plane Algorithms for the Maximum Selective Tree Problem
  Onar, Ömer Burak ; Ekim, Tınaz ; Taşkın, Z. Caner 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Complexity of Finding Maximum Locally Irregular Induced Subgraphs
  Fioravantes, Foivos ; Melissinos, Nikolaos ; Triommatis, Theofilos 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Maximum Induced Trees in Sparse Random Graphs
  Buitrago Oropeza, J. C.
• Vertex cover-based binary tree algorithm to detect all maximum common induced subgraphs in large communication networks
  Nirmala, Parisutham ; Lekshmi, Ramasubramony Sulochana ; Nadarajan, Rethnasamy