{"id":"W2579056633","doi":"10.4230/lipics.isaac.2016.20","title":"Degree-Constrained Orientation of Maximum Satisfaction : Graph Classes and Parameterized Complexity","year":2016,"lang":"en","type":"article","venue":"TU/e Research Portal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Combinatorics; Treewidth; Mathematics; Chordal graph; Pathwidth; Degeneracy (biology); Discrete mathematics; Parameterized complexity; Indifference graph; Split graph; 1-planar graph; Independent set; Bipartite graph; Bounded function; Time complexity; Clique-sum; Graph; Line graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001916721,0.0001381373,0.0002333293,0.0005300313,0.0002121478,0.00008019743,0.0004719576,0.0000719924,0.0001495928],"category_scores_gemma":[0.0006345566,0.000100921,0.000066728,0.0009087967,0.001500932,0.0008882923,0.0003324489,0.0002453678,0.00002103504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003579099,"about_ca_system_score_gemma":0.000170192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001208856,"about_ca_topic_score_gemma":0.0001027142,"domain_scores_codex":[0.9969249,0.0005559213,0.0003401364,0.000516496,0.001059722,0.0006028608],"domain_scores_gemma":[0.9976087,0.0009627106,0.0001124418,0.0005980569,0.0004831576,0.0002349729],"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.0002589499,0.0001023311,0.03849765,0.0000713981,0.00006318399,0.00007628631,0.0003102208,0.000001274841,0.1801596,0.4055011,0.0002206715,0.3747373],"study_design_scores_gemma":[0.002040593,0.000761446,0.2550259,0.00009517417,0.000005158027,0.00009734224,0.0003143986,0.0005966065,0.03354379,0.7070619,0.0001708558,0.0002868246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8117939,0.00005787833,0.1853004,0.0005982514,0.00007790379,0.000454746,0.00002915649,0.00008961822,0.001598206],"genre_scores_gemma":[0.9793515,0.0001022824,0.02035297,0.000007983625,0.00002209283,0.0000416793,0.000004117198,0.00001142829,0.0001059965],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3744504,"threshold_uncertainty_score":0.5530245,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1420065513155185,"score_gpt":0.3923633862723219,"score_spread":0.2503568349568034,"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."}}