{"id":"W2114909581","doi":"10.7155/jgaa.00256","title":"Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Planar straight-line graph; Planar graph; Combinatorics; Vertex (graph theory); Planar; Graph; Outerplanar graph; Computer science; Mathematics; 1-planar graph; Pathwidth; Line graph; Computer graphics (images)","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.0006041045,0.000885612,0.0009441565,0.00051995,0.0007466649,0.001006059,0.001646486,0.001120115,0.003299027],"category_scores_gemma":[0.005027996,0.0005354612,0.0005410173,0.0006840266,0.0009355235,0.002199465,0.0009058935,0.0009038489,0.0003343388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00134194,"about_ca_system_score_gemma":0.0008040372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002389691,"about_ca_topic_score_gemma":0.003792385,"domain_scores_codex":[0.9994577,0.0001441014,0.00002082904,0.0001778639,0.00007082606,0.0001287276],"domain_scores_gemma":[0.9965642,0.002298053,0.0005275379,0.0002222813,0.0001463783,0.0002415235],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001375111,0.0002057032,0.003237851,0.0004778512,0.00008707015,0.0003265917,0.0002702757,0.8899449,0.03108219,0.01581711,0.002419981,0.05475537],"study_design_scores_gemma":[0.0001334134,0.0005164722,0.001015473,0.00002618136,0.00006576667,0.0001989682,0.0002246235,0.9559646,0.01246375,0.02776963,0.001591382,0.0000296257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7965491,0.0003996404,0.1980197,0.0004989425,0.00003433201,0.0001054455,0.0003939612,0.0007195073,0.003279369],"genre_scores_gemma":[0.834935,0.0002448068,0.1614959,0.00007282847,0.00002289487,0.00009903624,0.0005613429,0.0002393389,0.002328879],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003299027,"threshold_uncertainty_score":0.01103634,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02824495418211327,"score_gpt":0.3234862292229718,"score_spread":0.2952412750408586,"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."}}