{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001706569,0.0009082062,0.001052594,0.0007850609,0.001113808,0.004877259,0.002514813,0.001656257,0.01235845],"category_scores_gemma":[0.01169352,0.0008311911,0.001982106,0.002482488,0.00184273,0.009580886,0.002449891,0.003410597,0.000840446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004093837,"about_ca_system_score_gemma":0.002159442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005361706,"about_ca_topic_score_gemma":0.006172454,"domain_scores_codex":[0.9975667,0.0007055874,0.0001243831,0.0007287221,0.0005060416,0.0003686066],"domain_scores_gemma":[0.9910125,0.005709873,0.0009801633,0.001526085,0.000357367,0.0004139102],"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.0004081078,0.000525008,0.006174775,0.0006038605,0.0001536593,0.0001920743,0.000696407,0.2070345,0.006501245,0.6485121,0.01860477,0.1105934],"study_design_scores_gemma":[0.0001077861,0.00003800451,0.0009793849,0.00003448918,0.00004569675,0.0001528924,0.0002139915,0.4011945,0.002462721,0.5886266,0.006117415,0.00002646496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2256249,0.0008059061,0.7374273,0.006447114,0.00009475943,0.0003748944,0.002595406,0.001635566,0.02499416],"genre_scores_gemma":[0.7413644,0.0009240309,0.2429519,0.000779524,0.0002036283,0.0004424813,0.004028279,0.0006007241,0.008705005],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01235845,"threshold_uncertainty_score":0.04134315,"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."}}