{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002373487,0.002287305,0.002967359,0.00198215,0.001300663,0.003670892,0.005413797,0.002600932,0.01064803],"category_scores_gemma":[0.01441201,0.00106237,0.001714171,0.005707666,0.001893556,0.01057995,0.00271551,0.003646181,0.001782884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003690745,"about_ca_system_score_gemma":0.002764954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008779399,"about_ca_topic_score_gemma":0.01031432,"domain_scores_codex":[0.9974401,0.0007311097,0.0001145438,0.000740674,0.00046007,0.0005135565],"domain_scores_gemma":[0.9906397,0.006007507,0.0006720188,0.001802297,0.0004560489,0.0004223559],"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.002605297,0.001092398,0.003144269,0.0008670263,0.0002809244,0.0002330865,0.0007225612,0.5615088,0.004436537,0.1476899,0.03292501,0.2444941],"study_design_scores_gemma":[0.0002229764,0.00009898426,0.0004083131,0.00002808178,0.00005795044,0.0001053234,0.0001344872,0.8357042,0.001005087,0.1603222,0.001890753,0.0000217491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.104491,0.001988691,0.8748285,0.002321189,0.000173531,0.0002734612,0.001205121,0.002682969,0.01203547],"genre_scores_gemma":[0.5511084,0.001253022,0.4361972,0.0004978922,0.0002925075,0.0003701101,0.003197038,0.0007900426,0.006293855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01064803,"threshold_uncertainty_score":0.03562123,"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."}}