{"id":"W2063494850","doi":"10.1016/j.ipl.2010.05.011","title":"Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs","year":2010,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Combinatorics; Bipartite graph; Mathematics; Indifference graph; Maximal independent set; Interval graph; Permutation graph; Pathwidth; Induced subgraph isomorphism problem; Cograph; Discrete mathematics; Clique-sum; Split graph; Algorithm; 1-planar graph; Line graph; Graph; Voltage graph","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004408214,0.0002248533,0.0001548669,0.0003624595,0.0007503144,0.001205028,0.0004879313,0.00007809598,0.000004208026],"category_scores_gemma":[0.00007255089,0.0001580563,0.00009223773,0.0005561172,0.0002882244,0.003362549,0.00007566183,0.0003281788,0.000008347339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001920831,"about_ca_system_score_gemma":0.0000604606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001239995,"about_ca_topic_score_gemma":0.000009111693,"domain_scores_codex":[0.9985289,0.00003210849,0.000477693,0.000261113,0.0003928119,0.0003073584],"domain_scores_gemma":[0.9988626,0.0001677204,0.0003344829,0.000302274,0.0002552249,0.00007775862],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004781849,0.00006567552,0.0004746976,0.0003137322,0.00004550941,0.00000103886,0.01147845,0.0003334556,0.004981799,0.1171803,0.000714681,0.8643628],"study_design_scores_gemma":[0.001842843,0.0003018634,0.006718911,0.0002565829,0.00004713124,0.0001264945,0.0006402985,0.9254496,0.005692525,0.04811925,0.009916153,0.0008883315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1394208,0.00003588694,0.8517661,0.0065661,0.0005984597,0.001086402,0.00002611239,0.0003173091,0.0001827947],"genre_scores_gemma":[0.9059928,0.00000989333,0.08980224,0.003810714,0.00004147609,0.0002879146,0.00003419445,0.00001256332,0.000008224479],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9251162,"threshold_uncertainty_score":0.9998318,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02339380593617962,"score_gpt":0.2534392109635155,"score_spread":0.2300454050273358,"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."}}