{"id":"W1973814258","doi":"10.1504/ijhpcn.2006.013490","title":"Real-time minimum vertex cover for two-terminal series-parallel graphs","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Vertex cover; Vertex (graph theory); Cardinality (data modeling); Terminal (telecommunication); Algorithm; Edge cover; Parallel algorithm; Series and parallel circuits; Series (stratigraphy); Graph; Time complexity; Theoretical computer science","routes":{"ca_aff":true,"ca_fund":true,"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.001089872,0.0004904054,0.0007994769,0.0007404161,0.000691215,0.0007754475,0.00110574,0.0006882417,0.002233011],"category_scores_gemma":[0.003626555,0.000301954,0.0006767365,0.0008035881,0.001154167,0.001910396,0.00123087,0.001040233,0.000217277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009994459,"about_ca_system_score_gemma":0.0007914493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001485388,"about_ca_topic_score_gemma":0.00183509,"domain_scores_codex":[0.9994875,0.0001210266,0.00002053217,0.0001038841,0.0001893926,0.00007755184],"domain_scores_gemma":[0.9983863,0.0009864096,0.0002047649,0.0001826781,0.0001481553,0.00009173508],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003816749,0.00008501006,0.00098359,0.0001668738,0.00003349832,0.0002298001,0.0001582488,0.8787772,0.01323973,0.05975763,0.001307926,0.0448787],"study_design_scores_gemma":[0.0000186397,0.00002845081,0.00009749633,0.000003905622,0.000003021193,0.00005308898,0.00002223711,0.9662017,0.002799365,0.03030107,0.0004669813,0.000004110777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.172446,0.0001221798,0.8237919,0.0002828215,0.00003318439,0.00006973882,0.00007363949,0.0002719896,0.002908594],"genre_scores_gemma":[0.6145477,0.0001577922,0.3819288,0.00006425495,0.00004441672,0.0001698533,0.0002595742,0.0001547234,0.002672968],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002233011,"threshold_uncertainty_score":0.007470131,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009274216943470406,"score_gpt":0.2574695263585593,"score_spread":0.2481953094150889,"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."}}