{"id":"W1526904710","doi":"10.1007/3-540-36379-3_35","title":"Connected and Loosely Connected List Homomorphisms","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chordal graph; Bipartite graph; Homomorphism; Combinatorics; Discrete mathematics; Time complexity; Pathwidth; Indifference graph; Mathematics; Graph homomorphism; Complete bipartite graph; Computer science; Graph; Line graph; Voltage graph","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.0005657322,0.0005533764,0.0005815928,0.002208357,0.002604223,0.003136557,0.001193744,0.0009338608,0.01434184],"category_scores_gemma":[0.003743076,0.0006670007,0.0007017195,0.003678904,0.002205742,0.01036399,0.003981453,0.002215859,0.002372604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008502257,"about_ca_system_score_gemma":0.00044715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005302466,"about_ca_topic_score_gemma":0.0006713188,"domain_scores_codex":[0.9993068,0.0001929369,0.00004544579,0.0001727887,0.0001830736,0.00009902023],"domain_scores_gemma":[0.9982238,0.0009370663,0.0001114702,0.0003536601,0.0001767307,0.0001972675],"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.00002969897,0.00002029882,0.0001608225,0.00006225024,0.000006210701,0.0000882805,0.0006485146,0.0005108219,0.0007764714,0.974838,0.002457394,0.02040114],"study_design_scores_gemma":[0.000006184035,0.00001049079,0.0001200397,0.00001814746,0.00001248353,0.0001481758,0.0001955548,0.001705234,0.0006844704,0.9844431,0.01264759,0.000008527702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1800649,0.002990362,0.5284557,0.002086358,0.0006373082,0.0001833603,0.0006281773,0.00209772,0.2828562],"genre_scores_gemma":[0.7244847,0.002647353,0.1160023,0.0007982349,0.0006150629,0.0003869429,0.001072001,0.0007816163,0.1532117],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01434184,"threshold_uncertainty_score":0.04797822,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02350317992220167,"score_gpt":0.2556002621492433,"score_spread":0.2320970822270416,"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."}}