{"id":"W2058105885","doi":"10.1145/1150334.1150337","title":"Bipartite roots of graphs","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Graph isomorphism; Complete bipartite graph; Discrete mathematics; Cograph; Time complexity; Edge-transitive graph; Line graph; Isomorphism (crystallography); Graph; Pathwidth; Voltage 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.0004444755,0.0004374714,0.0006981249,0.001031695,0.001003301,0.001768545,0.0009484112,0.001259795,0.008933133],"category_scores_gemma":[0.004084856,0.0004698551,0.0005382347,0.001267392,0.001572115,0.004104979,0.00219968,0.001796053,0.001998168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008094882,"about_ca_system_score_gemma":0.0005835646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00146218,"about_ca_topic_score_gemma":0.001749073,"domain_scores_codex":[0.9986707,0.0002477198,0.00007102466,0.0004768593,0.0003216875,0.0002120029],"domain_scores_gemma":[0.9978502,0.0009854913,0.0002442511,0.000404051,0.0003331417,0.0001829162],"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.0003162174,0.0001200522,0.00336832,0.0006592502,0.00006764635,0.0004898788,0.001095657,0.01353006,0.02440658,0.8008711,0.02816237,0.1269129],"study_design_scores_gemma":[0.00004110606,0.00006690862,0.001589487,0.00006387218,0.00002779387,0.0007855562,0.0004499484,0.03722242,0.007162099,0.8991502,0.05341088,0.0000297621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2150124,0.001827542,0.7003769,0.003177018,0.0004172831,0.0006115076,0.004653538,0.002987323,0.07093643],"genre_scores_gemma":[0.6218882,0.001119322,0.3435248,0.0009328423,0.0003295602,0.0003540957,0.005574281,0.0005080441,0.02576887],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008933133,"threshold_uncertainty_score":0.02988428,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01969786754119153,"score_gpt":0.2844186336568095,"score_spread":0.264720766115618,"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."}}