{"id":"W1490843286","doi":"10.1007/978-3-642-14031-0_17","title":"Finding Maximum Edge Bicliques in Convex Bipartite Graphs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"Hospital for Sick Children; Carleton University","funders":"","keywords":"Combinatorics; Bipartite graph; Complete bipartite graph; Vertex (graph theory); Cardinality (data modeling); Mathematics; Edge-transitive graph; Discrete mathematics; Graph; Computer science; Graph power; Line graph","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006971774,0.0004050992,0.0004563326,0.001091497,0.00009339886,0.0001730411,0.0008400051,0.0004552383,0.00005108851],"category_scores_gemma":[0.00002708824,0.0003866936,0.0001049088,0.0004610736,0.0004746893,0.0002300105,0.0001469648,0.001169398,0.0000456985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008741493,"about_ca_system_score_gemma":0.0000581101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000015026,"about_ca_topic_score_gemma":0.0002629175,"domain_scores_codex":[0.9981142,0.0000213907,0.0004223691,0.0005909635,0.000324785,0.0005262424],"domain_scores_gemma":[0.9989903,0.0002112542,0.00007806766,0.0005663129,0.00004690971,0.0001071845],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004528933,0.00008556326,0.00658393,0.001256909,0.0001069358,0.0007614048,0.009319437,0.1579874,0.04258678,0.1294507,0.0001148939,0.6517008],"study_design_scores_gemma":[0.0004591332,0.0001127667,0.0007383023,0.001627562,0.00001364615,0.000093002,9.226674e-7,0.09611025,0.02671042,0.8637545,0.008823401,0.001556099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04451185,0.001881126,0.9282662,0.0001167025,0.009187884,0.0007223223,0.00001827301,0.0005863085,0.01470934],"genre_scores_gemma":[0.992063,0.00005716469,0.007250035,0.0001734139,0.0002801397,0.00001261241,0.000004802253,0.0000558884,0.0001029068],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9475512,"threshold_uncertainty_score":0.9998585,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01211060963806525,"score_gpt":0.2181380829015707,"score_spread":0.2060274732635055,"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."}}