{"id":"W4308487050","doi":"10.1016/j.parco.2022.102984","title":"Efficient parallel branch-and-bound approaches for exact graph edit distance problem","year":2022,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"Direction Générale de la Recherche Scientifique et du Développement Technologique","keywords":"Computer science; Speedup; Search tree; Pruning; Branch and bound; Theoretical computer science; Graph; Parallel computing; Algorithm; Search algorithm","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002275577,0.002245014,0.002662168,0.001805508,0.001492871,0.002816617,0.003265942,0.001574991,0.007301641],"category_scores_gemma":[0.005927112,0.0007772134,0.001256595,0.002710945,0.0008909539,0.003538244,0.002774336,0.002318547,0.001451666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00169626,"about_ca_system_score_gemma":0.003861676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006131713,"about_ca_topic_score_gemma":0.007897889,"domain_scores_codex":[0.9977109,0.0005686238,0.000123305,0.0005021398,0.000642931,0.0004520279],"domain_scores_gemma":[0.9962618,0.002312035,0.0002287202,0.0004862734,0.00043857,0.0002725302],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007608481,0.0006019975,0.001037431,0.0005029705,0.0001558888,0.0002274871,0.000265795,0.629071,0.00547169,0.03280023,0.01284282,0.3162619],"study_design_scores_gemma":[0.00008554394,0.000061602,0.0001067892,0.000009259888,0.00002163597,0.00003838311,0.00004476114,0.9809132,0.0007185286,0.01669809,0.001295032,0.000007263306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04297417,0.002379293,0.938783,0.001071167,0.0002000341,0.0003892776,0.000309579,0.002915917,0.01097767],"genre_scores_gemma":[0.2685211,0.0007362809,0.7236525,0.0003375548,0.00017691,0.0006319877,0.001009352,0.0005952968,0.004338992],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007301641,"threshold_uncertainty_score":0.0244264,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02693764481373495,"score_gpt":0.2351926344659796,"score_spread":0.2082549896522446,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}