{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006902108,0.002130603,0.001567818,0.002871244,0.001730833,0.001811203,0.002820672,0.001318796,0.01505471],"category_scores_gemma":[0.0025953,0.001112272,0.001923441,0.002860594,0.001056478,0.003024838,0.002831536,0.001951348,0.004827249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001725787,"about_ca_system_score_gemma":0.002838488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005807788,"about_ca_topic_score_gemma":0.01427815,"domain_scores_codex":[0.9986907,0.0001672543,0.00009713736,0.0002816798,0.0005451784,0.0002180787],"domain_scores_gemma":[0.9986854,0.0005303692,0.00008635963,0.0003762681,0.0002480867,0.00007348941],"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.0003307739,0.0004179181,0.0007045662,0.0007089541,0.0001218601,0.0001611208,0.0003732683,0.03448155,0.01454141,0.02349854,0.05650866,0.8681514],"study_design_scores_gemma":[0.0008100303,0.0005000276,0.001463536,0.0002034264,0.000301696,0.001243346,0.0006945162,0.6160169,0.03622292,0.24414,0.0982293,0.0001743189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01242583,0.001178539,0.9647227,0.000798516,0.0001588911,0.0006216207,0.0009493045,0.01063644,0.008508092],"genre_scores_gemma":[0.04065558,0.0003277632,0.9489821,0.0002620353,0.00005524546,0.0004241739,0.001937021,0.0006032769,0.006752845],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01505471,"threshold_uncertainty_score":0.050363,"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."}}