{"id":"W1991223992","doi":"10.1016/j.dam.2007.08.013","title":"Planar graph bipartization in linear time","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Planar graph; Combinatorics; Planar; Graph; Vertex (graph theory); Transversal (combinatorics); Planar straight-line graph; Time complexity; Discrete mathematics; Mathematical analysis; Pathwidth; Line graph; Computer science","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.0009922307,0.001356078,0.002387381,0.001530182,0.002327786,0.004832175,0.00274873,0.001752451,0.03451855],"category_scores_gemma":[0.006642195,0.0009953101,0.001740284,0.004300643,0.001708742,0.007858904,0.004050033,0.003204275,0.004937278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003505468,"about_ca_system_score_gemma":0.002577421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006194681,"about_ca_topic_score_gemma":0.00949071,"domain_scores_codex":[0.9978199,0.0004065953,0.000103243,0.0005535226,0.0005521817,0.0005646325],"domain_scores_gemma":[0.9955133,0.002288846,0.0003823309,0.001029003,0.0003942696,0.0003922601],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002473215,0.0008047511,0.001400682,0.001507288,0.0002916919,0.0002923621,0.0009246306,0.1433364,0.02011408,0.4300988,0.07009037,0.3286657],"study_design_scores_gemma":[0.0005205133,0.0002176176,0.0007932734,0.00007346069,0.000200996,0.0002637286,0.0004906451,0.3019852,0.008785803,0.6650611,0.0215506,0.00005708883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.162392,0.001371929,0.7154276,0.004291732,0.0004676082,0.000813621,0.004059292,0.01017433,0.101002],"genre_scores_gemma":[0.4804009,0.000987647,0.4501435,0.001102509,0.000269841,0.0006688501,0.006134951,0.002403625,0.05788818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03451855,"threshold_uncertainty_score":0.115476,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01678555882454132,"score_gpt":0.2884691405430597,"score_spread":0.2716835817185184,"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."}}