{"id":"W2408452789","doi":"10.1080/03155986.2005.11732724","title":"Different Formulations for Solving the Heaviest<i>K</i>-Subgraph Problem","year":2005,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Block (permutation group theory); Integer programming; Enhanced Data Rates for GSM Evolution; Mathematics; Graph; Induced subgraph isomorphism problem; Linear programming; Induced subgraph; Discrete mathematics; Mathematical optimization; Computer science; Line graph; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002167634,0.001303417,0.001053962,0.0008436032,0.0004591661,0.002165621,0.002931691,0.001553368,0.005259158],"category_scores_gemma":[0.005959741,0.0006446646,0.001694176,0.001830105,0.0009583771,0.003372422,0.001290604,0.002838011,0.0006306797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001458448,"about_ca_system_score_gemma":0.001514317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001754248,"about_ca_topic_score_gemma":0.002770875,"domain_scores_codex":[0.99865,0.0006371789,0.00007060879,0.0002287773,0.0002416547,0.0001718316],"domain_scores_gemma":[0.9979088,0.001298431,0.0002222934,0.0002225823,0.0002172537,0.000130592],"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.0003158579,0.000404152,0.0009452312,0.0008733227,0.000169556,0.0001416927,0.0002499075,0.6760481,0.00375911,0.1924811,0.009729657,0.1148824],"study_design_scores_gemma":[0.00009282208,0.0001703787,0.000319443,0.00008688674,0.00006245059,0.0001405401,0.0001619743,0.905338,0.002482229,0.08651898,0.004592153,0.00003410698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02255439,0.0009691233,0.9622133,0.001006183,0.0001062048,0.0002331437,0.0003395624,0.000229173,0.01234898],"genre_scores_gemma":[0.1935956,0.001663979,0.7970339,0.0006468515,0.0001813425,0.0005121471,0.0008228933,0.0003663618,0.005176915],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005259158,"threshold_uncertainty_score":0.01759362,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06202741432814226,"score_gpt":0.3603149411181166,"score_spread":0.2982875267899744,"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."}}