{"id":"W1557139302","doi":"10.1007/11534273_26","title":"A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Adjacency list; Computer science; Graph; Adjacency matrix; Labelling; Line (geometry); Combinatorics; Scheme (mathematics); Line graph; Discrete mathematics; Algorithm; Mathematics; Theoretical 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.0009270546,0.0006050261,0.0006842258,0.001255499,0.001437026,0.002218873,0.002837566,0.00106923,0.01389981],"category_scores_gemma":[0.003433818,0.0006804493,0.0006634672,0.002403486,0.001155454,0.005165633,0.002958836,0.002388302,0.004159267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009912376,"about_ca_system_score_gemma":0.0009401566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001834658,"about_ca_topic_score_gemma":0.003202575,"domain_scores_codex":[0.9991624,0.0001929007,0.00006553928,0.0001811633,0.0002906897,0.0001072286],"domain_scores_gemma":[0.9975132,0.0006207433,0.0001165309,0.001255946,0.0003887733,0.000104925],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002330503,0.0001576314,0.0001999396,0.0002120509,0.00001585805,0.00008020073,0.0005557539,0.02679237,0.01477241,0.6101887,0.01342468,0.3333673],"study_design_scores_gemma":[0.00009569208,0.0001130841,0.0001802297,0.0001139067,0.00004616189,0.0001533133,0.0001783006,0.2561021,0.01625694,0.6369133,0.0897608,0.00008623057],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006930134,0.00005358646,0.9825616,0.00009087761,0.00005802992,0.00007592964,0.0003509316,0.001459568,0.008419242],"genre_scores_gemma":[0.1092438,0.0002281983,0.8687821,0.0001150863,0.0000622077,0.0002652903,0.001186977,0.0007598082,0.01935648],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01389981,"threshold_uncertainty_score":0.04649949,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009875477647055073,"score_gpt":0.2239991909103408,"score_spread":0.2141237132632857,"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."}}