{"doi":"10.1016/j.amc.2005.09.058","title":"A new approach for computing a most positive cut using the minimum flow algorithms","abstract":null,"journal":"Applied Mathematics and Computation","year":2006,"id":20581,"datarank":0.6487355245798083,"base_score":1.9459101490553132,"endowment":1.9459101490553132,"self_citation_contribution":0.29188652235829704,"citation_network_contribution":0.35684900222151134,"self_endowment_contribution":0.29188652235829704,"citer_contribution":0.35684900222151134,"corpus_percentile":null,"corpus_rank":null,"citation_count":6,"citer_count":5,"citers_with_citation_signal":5,"citers_with_endowment":5,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":135530,"name":"Mehdi Ghiyasvand","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":1.9459101490553132,"endowment":1.9459101490553132,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"21071399","pmcid":null,"openalex_id":"https://openalex.org/W2080904092","authors":[],"funders":[],"total_grants":0,"fwci":0.3372,"citation_percentile":0.6286503,"influential_citations":0,"citation_trend":[{"year":2012,"count":2},{"year":2013,"count":1},{"year":2016,"count":1}],"oa_status":"closed","license":"https://www.elsevier.com/tdm/userlicense/1.0/","oa_locations":[{"url":"https://api.elsevier.com/content/article/PII:S0096300305007678?httpAccept=text/xml","host_type":"publisher"},{"url":"https://api.elsevier.com/content/article/PII:S0096300305007678?httpAccept=text/plain","host_type":"publisher"},{"url":"https://doi.org/10.1016/j.amc.2005.09.058","host_type":"journal"}],"fields_of_study":["Complexity and Algorithms in Graphs","Optimization and Search Problems","Computational Geometry and Mesh Generation","Mathematics","Computer Science"],"mesh_terms":[],"keywords":["Minimum-cost flow problem","Maximum flow problem","Multi-commodity flow problem","Flow network","Minimum cut","Out-of-kilter algorithm","Flow (mathematics)","Algorithm","Computation","Node (physics)","Computer science","Mathematics","Maximum cut","Mathematical optimization","Theoretical computer science","Graph","Shortest path problem"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-06T02:13:01.053216Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}