{"id":"W2039582686","doi":"10.1007/s004530010019","title":"Linear-Time Algorithms for Partial \\boldmath k -Tree Complements","year":2000,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Time complexity; Combinatorics; Complement (music); Discrete mathematics; Algorithm; Graph; Vertex (graph theory); Theory of computation","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.001041932,0.001185012,0.00142962,0.001433092,0.002649712,0.005622491,0.003280754,0.002028775,0.02871509],"category_scores_gemma":[0.007070203,0.001128353,0.001711334,0.002734966,0.002011903,0.01061032,0.004230856,0.003295795,0.003452272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002716919,"about_ca_system_score_gemma":0.002887564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004948277,"about_ca_topic_score_gemma":0.01196802,"domain_scores_codex":[0.9986971,0.0002630569,0.00008319506,0.00035129,0.000304413,0.000300909],"domain_scores_gemma":[0.9954212,0.002950317,0.000196733,0.0007164557,0.0004418359,0.0002734635],"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.001240326,0.0007219981,0.002468083,0.001398114,0.0001751166,0.0003401991,0.001061378,0.0408654,0.006036394,0.620443,0.05486215,0.2703878],"study_design_scores_gemma":[0.0002744627,0.00009321832,0.0006777193,0.0001555706,0.0001649112,0.0003809702,0.0007152618,0.1438345,0.007722018,0.8264896,0.01943275,0.00005913084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2906254,0.001971998,0.5862364,0.006084173,0.0004991979,0.0007311674,0.004634383,0.006311352,0.102906],"genre_scores_gemma":[0.5370952,0.0007905515,0.4286689,0.0007581774,0.0001678948,0.0004050247,0.00599483,0.001174148,0.02494517],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02871509,"threshold_uncertainty_score":0.09606147,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03424946569837089,"score_gpt":0.3275318350476837,"score_spread":0.2932823693493128,"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."}}