{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001298777,0.0002741078,0.0003169224,0.0001420212,0.001518219,0.0002457045,0.00104839,0.00004060306,0.000007460611],"category_scores_gemma":[0.00002235006,0.0002731057,0.0001767037,0.0005364846,0.0001179723,0.0001156084,0.0008135734,0.0003093539,0.000004379294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004607937,"about_ca_system_score_gemma":0.00004560364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007725949,"about_ca_topic_score_gemma":0.000001445104,"domain_scores_codex":[0.9975506,0.0002073223,0.0003914862,0.0008139585,0.0003897739,0.0006468395],"domain_scores_gemma":[0.9987456,0.0003804785,0.0002200729,0.0004763651,0.00004198747,0.000135545],"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.00004435974,0.000194061,0.0002886851,0.00008220553,0.00004851992,0.000007740065,0.00260727,0.5333433,0.00003003437,0.4344092,0.000352142,0.02859255],"study_design_scores_gemma":[0.0009636956,0.0001567916,0.0006711162,0.00001977857,0.00001129504,0.00004473568,0.0001860765,0.8936511,0.00001489101,0.1006583,0.00321908,0.0004031776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0367769,0.0008940365,0.9594344,0.0005560673,0.0005853324,0.0006832092,0.00001090179,0.0002625579,0.0007965475],"genre_scores_gemma":[0.8554273,0.000003248697,0.1439116,0.0001980455,0.0001595746,0.0001390767,0.00001103254,0.00002069508,0.0001293917],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8186504,"threshold_uncertainty_score":0.9999721,"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."}}