{"id":"W194649186","doi":"10.1007/978-3-642-25011-8_24","title":"On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multigraph; Combinatorics; Vertex (graph theory); Planar graph; Graph; Planar; Mathematics; Plane (geometry); Discrete mathematics; Computer science; Geometry","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.0009394367,0.002668669,0.002139258,0.001131867,0.001133871,0.001788548,0.003324011,0.002261474,0.007940022],"category_scores_gemma":[0.006456435,0.001060365,0.0009409416,0.001993167,0.001646156,0.003196785,0.002235761,0.001956456,0.00112097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001844282,"about_ca_system_score_gemma":0.001091628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00294153,"about_ca_topic_score_gemma":0.003999431,"domain_scores_codex":[0.9993184,0.0002318086,0.00002576575,0.0001658538,0.0001332178,0.000125047],"domain_scores_gemma":[0.9956802,0.003168157,0.0003367449,0.0003283916,0.000229934,0.0002565864],"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.0008413509,0.0003007764,0.001544101,0.0008101299,0.0001025677,0.0001653809,0.0002859368,0.7692937,0.01556845,0.05605982,0.01068617,0.1443417],"study_design_scores_gemma":[0.00009054776,0.0003216123,0.0009112397,0.00005311011,0.0000644299,0.000134073,0.0001724128,0.8918104,0.003692674,0.1004802,0.002242306,0.00002692727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2794451,0.001412592,0.6935351,0.00130887,0.0002781014,0.0002466818,0.0005998523,0.001303608,0.0218701],"genre_scores_gemma":[0.4802567,0.001569174,0.4881972,0.0003402568,0.0002798525,0.000506292,0.001598692,0.001958035,0.0252938],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007940022,"threshold_uncertainty_score":0.02656204,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03404041091732289,"score_gpt":0.2868589059006162,"score_spread":0.2528184949832933,"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."}}