{"id":"W2106579389","doi":"10.1109/synasc.2009.48","title":"A Depth-first Algorithm to Reduce Graphs in Linear Time","year":2009,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Time complexity; Vertex (graph theory); Combinatorics; Reduction (mathematics); Algorithm; Graph; Graph algorithms; Computer science; Discrete mathematics; Mathematics; Geometry","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001692657,0.0001242543,0.0001442106,0.0001857108,0.00007360888,0.00009273934,0.0008506959,0.00005154357,0.00004302177],"category_scores_gemma":[0.00001744688,0.0001024565,0.00003866545,0.0007191575,0.000009779849,0.0004596304,0.0002376775,0.0001036416,0.000530451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002458624,"about_ca_system_score_gemma":0.00002904029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009700152,"about_ca_topic_score_gemma":0.00001870318,"domain_scores_codex":[0.9988427,0.00002281916,0.0001927194,0.0004177718,0.0002276443,0.000296414],"domain_scores_gemma":[0.9991518,0.00003018153,0.00002703545,0.000593714,0.00003693697,0.0001602781],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004719288,0.0001460014,0.00004071095,0.000001240306,0.00000220617,0.00004625706,0.0002273265,0.00009393661,0.0004936638,0.005135586,0.02018725,0.9736211],"study_design_scores_gemma":[0.0009163618,0.000523429,0.02679989,0.0001049616,0.000003007829,0.00004903317,0.00001743859,0.8895882,0.003989642,0.01305318,0.06430233,0.0006525319],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00294335,0.00006295773,0.9862963,0.003554347,0.0002421113,0.0002059211,0.000003308078,0.0002477689,0.006443954],"genre_scores_gemma":[0.02112955,0.00001353739,0.9751613,0.001886892,0.00008886283,0.000008340972,0.000006856846,0.000006623865,0.001698076],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9729686,"threshold_uncertainty_score":0.6818051,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01251942052605064,"score_gpt":0.2610468861688211,"score_spread":0.2485274656427705,"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."}}