{"id":"W1543181490","doi":"10.1007/978-3-540-73556-4_6","title":"Searching Cycle-Disjoint Graphs","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Disjoint sets; Computer science; Graph; Time complexity; Vertex (graph theory); Running time; Mathematics; Discrete mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006586767,0.001114861,0.001472535,0.002609333,0.001162914,0.001761688,0.003213358,0.001909696,0.02167834],"category_scores_gemma":[0.006322696,0.001034767,0.001316244,0.004330599,0.001045779,0.004637512,0.003873843,0.001424895,0.002638286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001090106,"about_ca_system_score_gemma":0.0009531942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001802041,"about_ca_topic_score_gemma":0.003661017,"domain_scores_codex":[0.9992126,0.0001591902,0.00005209785,0.0002288394,0.0002267389,0.0001204207],"domain_scores_gemma":[0.9975932,0.001519885,0.0001309434,0.0004224601,0.0001851839,0.000148298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009107546,0.0004597094,0.003379257,0.001932415,0.0002430044,0.0004137398,0.0007807922,0.1123186,0.01786991,0.1426729,0.05019713,0.6688219],"study_design_scores_gemma":[0.0002955657,0.0003348438,0.001381833,0.0002741946,0.0002369213,0.0008955667,0.0008629895,0.4327282,0.01509488,0.5152388,0.03259078,0.00006536917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.282511,0.003255263,0.6168687,0.002629911,0.0003220138,0.0006486461,0.002736041,0.003398786,0.08762974],"genre_scores_gemma":[0.4088897,0.001742622,0.5531549,0.0005494605,0.0001367756,0.000327138,0.008673893,0.0008049959,0.02572066],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02167834,"threshold_uncertainty_score":0.07252133,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03334642201468271,"score_gpt":0.2770830695380785,"score_spread":0.2437366475233958,"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."}}