{"id":"W2083976285","doi":"10.1007/s00373-007-0706-3","title":"An O(n3)-Time Recognition Algorithm for hhds-free Graphs","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Combinatorics; Split graph; Indifference graph; Pathwidth; Mathematics; Time complexity; Discrete mathematics; Maximal independent set; Interval graph; Graph; 1-planar graph; Line 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.0003986276,0.001254145,0.001277442,0.001133861,0.001294897,0.002553999,0.002769688,0.001548981,0.01790684],"category_scores_gemma":[0.001762682,0.0008310082,0.001421011,0.001766174,0.0007590769,0.004706406,0.002881789,0.001648067,0.006171021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001574071,"about_ca_system_score_gemma":0.001916157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006016111,"about_ca_topic_score_gemma":0.01083772,"domain_scores_codex":[0.9989396,0.0001014057,0.00007455755,0.0004139954,0.0002152273,0.0002553541],"domain_scores_gemma":[0.9983174,0.0005711837,0.00009651839,0.000634336,0.0002304034,0.0001502431],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009724003,0.0004728559,0.003219254,0.0004696627,0.0001048721,0.0002936318,0.0003445631,0.02538694,0.0458587,0.01689918,0.04161035,0.8643675],"study_design_scores_gemma":[0.0004876626,0.0003133159,0.004091641,0.00009136439,0.0002456889,0.0008568469,0.0009766571,0.7374077,0.0945001,0.122931,0.03793135,0.0001667414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1562603,0.0006404702,0.7882944,0.001398348,0.0002924471,0.0004097106,0.001972938,0.02715732,0.02357405],"genre_scores_gemma":[0.3959739,0.000245159,0.5732979,0.0005874601,0.00008584938,0.000338388,0.008144001,0.001623879,0.01970363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01790684,"threshold_uncertainty_score":0.05990434,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01891511058609866,"score_gpt":0.2779508647299208,"score_spread":0.2590357541438221,"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."}}