{"id":"W1559047461","doi":"","title":"Simple, Linear-Time Modular Decomposition","year":2007,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Modular decomposition; Modular design; Computer science; Simple (philosophy); Time complexity; Decomposition; Undirected graph; Graph theory; Algorithm; Theoretical computer science; Graph; Tree decomposition; Linear programming; Mathematical optimization; Mathematics; Line graph; Combinatorics; Pathwidth","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.0008812789,0.001388115,0.001045818,0.0007549875,0.001182372,0.002902058,0.001243592,0.0008839623,0.03929738],"category_scores_gemma":[0.002856857,0.0004807495,0.001352481,0.001214185,0.001036856,0.004533523,0.00204201,0.002266939,0.01054229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001235501,"about_ca_system_score_gemma":0.001178988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003526754,"about_ca_topic_score_gemma":0.001002182,"domain_scores_codex":[0.9991671,0.0001257655,0.00003471075,0.0002690302,0.0002310825,0.0001724069],"domain_scores_gemma":[0.9983729,0.0004836617,0.0001500428,0.0003545777,0.0003364608,0.0003023154],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001626003,0.0009043058,0.001298991,0.001426192,0.000145112,0.000722877,0.0006028085,0.01616551,0.03732929,0.5731112,0.1180013,0.2486664],"study_design_scores_gemma":[0.000258571,0.0001720441,0.0005094933,0.00003741285,0.00006878986,0.0004165164,0.0001014082,0.02358496,0.006992247,0.9428052,0.02501757,0.0000358181],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1364861,0.0008702526,0.7095853,0.00436629,0.001539172,0.000702533,0.002420492,0.004464128,0.1395657],"genre_scores_gemma":[0.5618855,0.001141528,0.271957,0.001486789,0.002561212,0.0004080864,0.005106072,0.001634316,0.1538196],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03929738,"threshold_uncertainty_score":0.1314628,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04160974537892125,"score_gpt":0.2305874513763769,"score_spread":0.1889777059974557,"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."}}