{"id":"W2035543139","doi":"10.1016/j.jda.2011.03.004","title":"Parameterized complexity of even/odd subgraph problems","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Parameterized complexity; Combinatorics; Induced subgraph isomorphism problem; Mathematics; Cograph; Vertex (graph theory); Pathwidth; Eulerian path; Discrete mathematics; Induced subgraph; Graph; Line graph; Voltage graph; Lagrangian","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.00233471,0.001268651,0.002051027,0.001009863,0.0019163,0.007190098,0.004351818,0.002337474,0.02027176],"category_scores_gemma":[0.01807057,0.0009386507,0.001967556,0.002741106,0.002241719,0.01287236,0.003325801,0.004634199,0.001358889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004877095,"about_ca_system_score_gemma":0.003535439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004514843,"about_ca_topic_score_gemma":0.0065098,"domain_scores_codex":[0.9967408,0.0009015426,0.000160648,0.0007621826,0.0006731686,0.0007617332],"domain_scores_gemma":[0.9829411,0.01228016,0.001014641,0.002099224,0.000623445,0.001041364],"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.00304435,0.001072252,0.01085104,0.001029432,0.0003207767,0.0005897239,0.001186388,0.2475374,0.01034433,0.5598372,0.04395376,0.1202334],"study_design_scores_gemma":[0.000297459,0.00006957945,0.001320397,0.00004165757,0.0001223728,0.0002346241,0.000347018,0.2740589,0.002672305,0.7163429,0.004458941,0.00003379851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6755803,0.002034819,0.2360554,0.01451526,0.0003957155,0.0004105685,0.006006001,0.001905368,0.06309648],"genre_scores_gemma":[0.925298,0.0009059237,0.0564477,0.0007514333,0.0003582516,0.0002597481,0.004598765,0.0007876042,0.01059261],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02027176,"threshold_uncertainty_score":0.06781578,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1012913606734593,"score_gpt":0.3090173922446653,"score_spread":0.2077260315712059,"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."}}