{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006363309,0.0001785978,0.000274386,0.0002460704,0.0002301915,0.0002858026,0.000790085,0.00005759754,0.000002988417],"category_scores_gemma":[0.00001065506,0.0001664501,0.0001059418,0.0001640545,0.00005501483,0.0005590365,0.0001951281,0.0001694823,0.000002603414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005624732,"about_ca_system_score_gemma":0.00006325168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002034887,"about_ca_topic_score_gemma":6.264889e-7,"domain_scores_codex":[0.9984494,0.00004708535,0.0006130756,0.0002326327,0.0003755073,0.0002822652],"domain_scores_gemma":[0.9985427,0.0002022599,0.0005894246,0.0001385518,0.000464965,0.00006210901],"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.000751591,0.0003009773,0.01274177,0.00007386773,0.0003516869,0.0001920819,0.0006177413,0.6738321,0.001743914,0.02683954,0.02342222,0.2591325],"study_design_scores_gemma":[0.001243533,0.0002878081,0.002904482,0.0003195088,0.00001384949,0.0007926403,0.000003121183,0.9872196,0.0004609587,0.004026367,0.002492316,0.0002357974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4443451,0.0002233926,0.5525613,0.0003097222,0.001715957,0.00008624403,0.000001346897,0.0001148357,0.0006420986],"genre_scores_gemma":[0.8323559,0.0002554423,0.166065,0.00009627452,0.00104654,0.000001370979,0.000006382683,0.00001210651,0.0001609861],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3880107,"threshold_uncertainty_score":0.6787639,"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."}}