{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009712856,0.002121749,0.003502883,0.003108803,0.0021285,0.002971568,0.003378793,0.003458445,0.01322401],"category_scores_gemma":[0.007865085,0.003079538,0.00147554,0.004282546,0.001584208,0.004701308,0.003376333,0.00360448,0.00274563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001384145,"about_ca_system_score_gemma":0.001024551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002851782,"about_ca_topic_score_gemma":0.00513062,"domain_scores_codex":[0.9990313,0.0003447287,0.00004129985,0.0002344912,0.0001770794,0.0001711283],"domain_scores_gemma":[0.9960235,0.002768786,0.0002844743,0.0002550778,0.0003751107,0.0002930441],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001406685,0.0006980201,0.004380411,0.003023648,0.0002622945,0.0003745633,0.0009185777,0.4192429,0.01406915,0.1780951,0.04918366,0.3283449],"study_design_scores_gemma":[0.0001781611,0.0002386908,0.001325688,0.0002680015,0.00006106904,0.000294737,0.0006418963,0.703504,0.005482077,0.280818,0.007130392,0.00005719102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1713035,0.001707163,0.7828745,0.001481452,0.000165574,0.000557669,0.00226957,0.00159084,0.03804968],"genre_scores_gemma":[0.3091081,0.0009612602,0.6691044,0.0004678662,0.0001186776,0.0005687012,0.003399652,0.001004143,0.01526717],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01322401,"threshold_uncertainty_score":0.04423869,"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."}}