{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001060656,0.0001533955,0.0002035809,0.0003260453,0.00007211413,0.000048432,0.0007020276,0.00007432315,0.00001746822],"category_scores_gemma":[0.00005462604,0.0001386323,0.00004368528,0.001069756,0.00007612784,0.0001991077,0.000134835,0.0001789472,0.0003163114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003407085,"about_ca_system_score_gemma":0.00002114845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001272549,"about_ca_topic_score_gemma":0.000005947147,"domain_scores_codex":[0.9984516,0.00001581235,0.0003844965,0.000301225,0.0003885846,0.0004582819],"domain_scores_gemma":[0.9988783,0.0002594517,0.0001033722,0.000614369,0.00003617305,0.0001083449],"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.00001331667,0.00008180001,0.00005060711,0.00004198349,0.000008235611,0.00001651582,0.001272343,0.0002537967,0.01490382,0.9806042,0.00008041282,0.002673018],"study_design_scores_gemma":[0.000496883,0.00003958462,0.0002541065,0.00003666223,0.000004331341,0.000008498264,0.000204404,0.0482472,0.01605852,0.9339495,0.0003786929,0.0003216534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01615296,0.00002022888,0.9679788,0.00007851834,0.00003886162,0.0003367926,0.000002213228,0.0001663068,0.01522535],"genre_scores_gemma":[0.3362678,0.00001241891,0.6630683,0.0001400086,0.00005046135,0.0000406942,0.00001852765,0.00004027284,0.0003614679],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3201149,"threshold_uncertainty_score":0.5653263,"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."}}