{"id":"W1507564261","doi":"10.1007/978-3-540-39890-5_11","title":"A Simple Linear Time LexBFS Cograph Recognition Algorithm","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Lexicographical order; Simple (philosophy); Algorithm; Complement (music); Cograph; Time complexity; Graph; Theoretical computer science; Combinatorics; Mathematics; Pathwidth; Line graph","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.0002471782,0.00104511,0.001027539,0.00118695,0.001038317,0.001745728,0.002084998,0.001122226,0.03107072],"category_scores_gemma":[0.0009565399,0.0005401503,0.0009975039,0.002110882,0.0005493218,0.003157759,0.001684946,0.001094591,0.01346121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001249475,"about_ca_system_score_gemma":0.002157384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00597795,"about_ca_topic_score_gemma":0.0116397,"domain_scores_codex":[0.9994548,0.00004898895,0.00004377363,0.0001975242,0.0001618206,0.00009314546],"domain_scores_gemma":[0.9995086,0.00009308441,0.00002646926,0.0001837659,0.0001416282,0.00004640855],"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.0004789237,0.0002761251,0.0005936904,0.0002839344,0.00003657928,0.0001357291,0.00009983083,0.007339915,0.02556541,0.01735963,0.05427401,0.8935562],"study_design_scores_gemma":[0.0006969895,0.0006191236,0.003005223,0.0001543553,0.0002211344,0.001203455,0.0007136801,0.5252719,0.1033067,0.1898161,0.1748224,0.0001690306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06439797,0.0006258513,0.8350625,0.001165541,0.0005567802,0.0005699594,0.00434048,0.05169269,0.04158825],"genre_scores_gemma":[0.1470418,0.0001971676,0.8060641,0.0003871294,0.0001075055,0.0002583183,0.009041213,0.001497676,0.03540498],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03107072,"threshold_uncertainty_score":0.1039419,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02345618118134686,"score_gpt":0.2791666446707617,"score_spread":0.2557104634894149,"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."}}