{"id":"W1994002660","doi":"10.1007/s10107-008-0242-9","title":"Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fleischer; Mathematics; Submodular set function; Algorithm; Function (biology); Minification; Polynomial; Combinatorial algorithms; Time complexity; Extension (predicate logic); Combinatorics; Discrete mathematics; Computer science; Mathematical optimization","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.003035475,0.002244497,0.001983083,0.001522326,0.002223142,0.00564871,0.005332076,0.00276996,0.01399928],"category_scores_gemma":[0.01911188,0.001358394,0.002538298,0.003044388,0.00343672,0.01389834,0.00563289,0.009339146,0.002352411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004052667,"about_ca_system_score_gemma":0.003846864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002916374,"about_ca_topic_score_gemma":0.005600083,"domain_scores_codex":[0.9968483,0.001160856,0.000123598,0.0007154365,0.0007030213,0.0004488313],"domain_scores_gemma":[0.9877431,0.008532858,0.0005843768,0.001946421,0.0007087254,0.0004844286],"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.0005168336,0.0005451869,0.0008370996,0.0004172553,0.00008468943,0.00005611462,0.0003278609,0.06231426,0.001912319,0.8002453,0.02472439,0.1080186],"study_design_scores_gemma":[0.00007302088,0.0000379497,0.0001824185,0.00003039047,0.00003249656,0.00004872913,0.00006084876,0.151387,0.0008718615,0.8443739,0.002881991,0.00001947172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04233226,0.0009476809,0.9149286,0.004359715,0.0002240326,0.0002285698,0.0007719238,0.001293894,0.03491344],"genre_scores_gemma":[0.3932998,0.001347986,0.5698802,0.001744364,0.0007164936,0.001014274,0.002386935,0.001377743,0.02823214],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01399928,"threshold_uncertainty_score":0.04683226,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03894664690511204,"score_gpt":0.2594211731772316,"score_spread":0.2204745262721196,"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."}}