{"id":"W1538503321","doi":"10.1007/978-1-4757-3145-3_25","title":"Continuous-based Heuristics for Graph and Tree Isomorphisms, with Application to Computer Vision","year":2000,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Heuristics; Clique; Quadratic programming; Computer science; Quadratic equation; Theoretical computer science; Clique problem; Graph; Mathematics; Mathematical optimization; Combinatorics; Line graph; Pathwidth","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.001728682,0.001703603,0.003150359,0.002913414,0.001126622,0.002404177,0.003510632,0.00245712,0.00731588],"category_scores_gemma":[0.007312993,0.001342694,0.001275347,0.005995904,0.001894656,0.003466995,0.002015969,0.003116361,0.001386515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002235164,"about_ca_system_score_gemma":0.002798513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0161263,"about_ca_topic_score_gemma":0.02007258,"domain_scores_codex":[0.9991087,0.0002469789,0.00004547519,0.0002459015,0.0002521868,0.0001007313],"domain_scores_gemma":[0.9958904,0.002643102,0.0002409322,0.0004711843,0.0005692501,0.0001851827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001848863,0.0002482235,0.0003915724,0.0002687268,0.0000792077,0.00008617419,0.0001292141,0.4952449,0.002640853,0.05562636,0.01523755,0.4298624],"study_design_scores_gemma":[0.0000360776,0.00003114582,0.0001041064,0.00001391129,0.00001159243,0.00002823395,0.00002960428,0.9689651,0.000715315,0.02853309,0.001519089,0.00001275832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00456603,0.0005097428,0.9918044,0.0001024242,0.00005368706,0.00006893857,0.0000910966,0.001106902,0.001696902],"genre_scores_gemma":[0.04899392,0.0003888377,0.9472865,0.00008309728,0.00007117665,0.0001510826,0.000355886,0.000515582,0.00215383],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0161263,"threshold_uncertainty_score":0.03206486,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006590814491085934,"score_gpt":0.2189472659255289,"score_spread":0.212356451434443,"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."}}