{"id":"W1988353915","doi":"10.1016/j.laa.2004.06.019","title":"Computation of minimal rank and path cover number for certain graphs","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":92,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Rank (graph theory); Cover (algebra); Disjoint sets; Vertex (graph theory); Path (computing); Vertex cover; Discrete mathematics; Graph; Computer science","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.0004197571,0.0004158752,0.0006576048,0.002032542,0.0006976494,0.001681729,0.0009391659,0.0005918626,0.005866372],"category_scores_gemma":[0.003762571,0.0002316226,0.0004582738,0.00139627,0.001077408,0.002654665,0.000616869,0.0007453709,0.0004470671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008661362,"about_ca_system_score_gemma":0.0006372526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008776627,"about_ca_topic_score_gemma":0.001630197,"domain_scores_codex":[0.9996369,0.00005797864,0.00001490475,0.0001038428,0.0001069608,0.00007939234],"domain_scores_gemma":[0.9977308,0.00126858,0.0003168928,0.0002222063,0.0002038467,0.0002577485],"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.001210786,0.0003908416,0.01962134,0.0006635844,0.0001114627,0.0006755673,0.000928421,0.08537611,0.03521013,0.7452415,0.009656864,0.1009134],"study_design_scores_gemma":[0.00007801652,0.0001972144,0.007940371,0.00003654877,0.00008069264,0.0007001331,0.0004122289,0.3203405,0.02360174,0.6424918,0.004044199,0.00007648107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8901355,0.0001913356,0.09566198,0.0003848026,0.00002117354,0.00003686102,0.001154229,0.0005511196,0.01186292],"genre_scores_gemma":[0.967512,0.00008357806,0.02866595,0.00002440595,0.00004660897,0.00002270472,0.001088995,0.00007833453,0.002477487],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005866372,"threshold_uncertainty_score":0.01962501,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02397068020351504,"score_gpt":0.3067599322323091,"score_spread":0.282789252028794,"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."}}