{"id":"W2037688351","doi":"10.5555/545381.545430","title":"I/O-optimal algorithms for planar graphs using separators","year":2002,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Planar graph; Planar straight-line graph; Breadth-first search; Planar; Algorithm; Book embedding; Computer science; Embedding; Outerplanar graph; Vertex (graph theory); Depth-first search; Graph; Search algorithm; Pathwidth; Theoretical computer science; Line graph; Artificial intelligence","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.0006547206,0.002103462,0.00100329,0.00147029,0.0009577519,0.001800917,0.002403235,0.001443282,0.01149397],"category_scores_gemma":[0.004960315,0.0007108533,0.001460709,0.002864146,0.001202828,0.0059966,0.0037441,0.002169881,0.003191057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001610747,"about_ca_system_score_gemma":0.001603442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001338788,"about_ca_topic_score_gemma":0.002253848,"domain_scores_codex":[0.9989261,0.0001622481,0.00008807305,0.0002548338,0.000336288,0.0002324052],"domain_scores_gemma":[0.9974126,0.001263501,0.0003878158,0.0005781585,0.0002498331,0.0001081309],"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.0007364142,0.0005016213,0.001338937,0.0008609644,0.0001492888,0.0001624967,0.0003673602,0.2112364,0.02367353,0.1183523,0.01719005,0.6254306],"study_design_scores_gemma":[0.000266335,0.000273127,0.0004723851,0.0001063936,0.0001020083,0.0002778394,0.0002427655,0.6551561,0.03850292,0.2867004,0.01784001,0.00005972583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02404862,0.0005290475,0.9610986,0.0003606766,0.00005534968,0.0001597471,0.0002621711,0.003872972,0.009612781],"genre_scores_gemma":[0.1428535,0.0006114024,0.847945,0.0001528414,0.00006668486,0.0003464286,0.00132818,0.0007824156,0.005913518],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01149397,"threshold_uncertainty_score":0.03845119,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04744852501361935,"score_gpt":0.2870264706846065,"score_spread":0.2395779456709872,"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."}}