- 专利标题： COMPILATION TECHNIQUE FOR SURFACE CODE ARCHITECTURE
-
申请号： US18120111申请日： 2023-03-10
-
公开(公告)号： US20230297867A1公开(公告)日： 2023-09-21
- 发明人: Arnaud GAZDA , Simon MARTIEL , Jon OILLARBURU
- 申请人： BULL SAS
- 申请人地址： FR LES CLAYES SOUS BOIS
- 专利权人： BULL SAS
- 当前专利权人： BULL SAS
- 当前专利权人地址： FR LES CLAYES SOUS BOIS
- 优先权： EP 305305.9 2022.03.16
- 主分类号： G06N10/20
- IPC分类号： G06N10/20
摘要：
Method for implementing a graph (G) comprising a plurality of vertices (V) and links (E) between the vertices, a set (R) being a collection of subsets (Ri) of said a given number of vertices (Rik) comprising:
in said set (R), selecting subsets (Ri, Rj), called pre-selected subsets, such that a tree (Ti, Tj) is associated respectively to said tree (Ti, Tj), said associated trees (Ti, Tj) being pairwise disjoint;
comparing the number of vertices (Rik) associated to each of the pre-selected subset,
among the pre-selected subsets, choosing the subset for which the number of vertices is the highest
in said set (R), selecting subsets (Ri, Rj), called pre-selected subsets, such that a tree (Ti, Tj) is associated respectively to said tree (Ti, Tj), said associated trees (Ti, Tj) being pairwise disjoint;
comparing the number of vertices (Rik) associated to each of the pre-selected subset,
among the pre-selected subsets, choosing the subset for which the number of vertices is the highest
信息查询
