{"id":"W2090354123","doi":"10.1016/j.dam.2008.08.020","title":"Finding a maximum-weight induced <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-partite subgraph of an <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>i</mml:mi></mml:math>-triangulated graph","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Clique graph; Block graph; Complete bipartite graph; Discrete mathematics; Graph; Line graph; Induced subgraph isomorphism problem; Induced subgraph; Cograph; Split graph; Algorithm; Pathwidth; Graph power; Voltage graph; Vertex (graph theory)","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.0003250176,0.0006167855,0.0008187215,0.00128563,0.00170999,0.001263299,0.001723136,0.001177234,0.01347005],"category_scores_gemma":[0.003277461,0.000566866,0.001167353,0.001657622,0.0008154662,0.001988353,0.001139964,0.0009841898,0.002990626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008818889,"about_ca_system_score_gemma":0.001295109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005015074,"about_ca_topic_score_gemma":0.0132139,"domain_scores_codex":[0.9996067,0.00006178032,0.00001703045,0.0001510653,0.00007877611,0.00008472643],"domain_scores_gemma":[0.9985564,0.0006918865,0.0001574202,0.0002081488,0.0002148151,0.0001713332],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001125005,0.001033335,0.01412274,0.003175118,0.0004417271,0.002133771,0.00255668,0.1650996,0.05873301,0.3239571,0.1311436,0.2964783],"study_design_scores_gemma":[0.0002119928,0.0003652567,0.004969488,0.0002176308,0.0002477293,0.001091826,0.00201544,0.3593846,0.03609705,0.5654508,0.02984946,0.00009861305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3481765,0.0004836154,0.5986447,0.002336356,0.0001748329,0.0006927746,0.006774041,0.001490753,0.04122641],"genre_scores_gemma":[0.5172837,0.0004968355,0.4388443,0.0003627446,0.00008264874,0.0002375802,0.01239466,0.0007342724,0.02956328],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01347005,"threshold_uncertainty_score":0.04506183,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02428673182251163,"score_gpt":0.2640691380083284,"score_spread":0.2397824061858168,"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."}}