default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 726 matches
- 2024
- Changhao Li, Huanjing Li, Tao Wu, Lei Yan, Suzhi Cao:
Realization of maximum flow in DTN and application in CGR. Ad Hoc Networks 152: 103302 (2024) - Xiangyu Guo, Shi Li, Kelin Luo, Yuhao Zhang:
Minimizing the Maximum Flow Time in the Online Food Delivery Problem. Algorithmica 86(4): 907-943 (2024) - Darshan Chauhan, Avinash Unnikrishnan, Stephen D. Boyles, Priyadarshan N. Patil:
Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption. Ann. Oper. Res. 335(2): 689-725 (2024) - Tanka Nath Dhamala, Mohan Chandra Adhikari, Durga Prasad Khanal, Urmila Pyakurel:
Generalized maximum flow over time with intermediate storage. Ann. Oper. Res. 335(1): 111-134 (2024) - Pablo Serrano, Antonio Virdis, Francesco Gringoli, Marco Gramaglia:
Can I Add a VR Flow? On the Maximum Capacity of 5G to Support 360° Video. IEEE Commun. Mag. 62(8): 78-83 (2024) - Hossein Alipour, Mario Andrés Muñoz, Kate Smith-Miles:
On the impact of initialisation strategies on Maximum Flow algorithm performance. Comput. Oper. Res. 163: 106492 (2024) - Hyunwoo Park, Chungmok Lee:
An exact algorithm for maximum electric vehicle flow coverage problem with heterogeneous chargers, nonlinear charging time and route deviations. Eur. J. Oper. Res. 315(3): 926-951 (2024) - Stefano Boccelli, Willem Kaufmann, Thierry E. Magin, James G. McDonald:
Numerical simulation of rarefied supersonic flows using a fourth-order maximum-entropy moment method with interpolative closure. J. Comput. Phys. 497: 112631 (2024) - Michele Gori:
A solution for abstract decision problems based on maximum flow value. Math. Soc. Sci. 130: 24-37 (2024) - Rebekka Haese, Till Heller, Sven O. Krumke:
Algorithms and complexity for the almost equal maximum flow problem. Networks 83(4): 642-652 (2024) - Jason Li, Debmalya Panigrahi:
Approximate Gomory-Hu Tree is Faster than \(\boldsymbol{n}\,\boldsymbol{-\, 1}\) Maximum Flows. SIAM J. Comput. 53(4): 1162-1180 (2024) - Matthew Ding, Jason Li:
Deterministic Minimum Steiner Cut in Maximum Flow Time. ESA 2024: 46:1-46:14 - Arpit Agarwal, Sanjeev Khanna, Huan Li, Prathamesh Patil, Chen Wang, Nathan White, Peilin Zhong:
Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth. SODA 2024: 3997-4061 - Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford:
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. SODA 2024: 2980-2998 - Kunal Agrawal, Benjamin Moseley, Heather Newman, Kirk Pruhs:
Scheduling Out-Trees Online to Optimize Maximum Flow. SPAA 2024: 77-88 - Ziming Zeng, Chao Dong, Jiajing Wu, Xiaojun Zhu, Lei Zhang:
Optimal UAV Swarm Reconstruction Strategy Based on Minimum Cost Maximum Flow Algorithm. WCNC 2024: 1-6 - Arpit Agarwal, Sanjeev Khanna, Huan Li, Prathamesh Patil, Chen Wang, Nathan White, Peilin Zhong:
Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth. CoRR abs/2402.14950 (2024) - Melvin H. Friedman, Brian L. Mark, Nathan H. Gartner:
Uninterrupted Maximum Flow on Signalized Traffic Networks. CoRR abs/2404.16592 (2024) - Chen-Hao Chao, Chien Feng, Wei-Fang Sun, Cheng-Kuang Lee, Simon See, Chun-Yi Lee:
Maximum Entropy Reinforcement Learning via Energy-Based Normalizing Flow. CoRR abs/2405.13629 (2024) - Shihua Gong, Young-Ju Lee, Yukun Li, Yue Yu:
Positivity and Maximum Principle Preserving Discontinuous Galerkin Finite Element Schemes for a Coupled Flow and Transport. CoRR abs/2405.16117 (2024) - Aaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak, Ta-Wei Tu:
Maximum Flow by Augmenting Paths in n2+o(1) Time. CoRR abs/2406.03648 (2024) - Jingwei Sun, Haifeng Wang, Hong Zhang, Xu Qian, Songhe Song:
Global-in-time energy stability: a powerful analysis tool for the gradient flow problem without maximum principle or Lipschitz assumption. CoRR abs/2406.07941 (2024) - Mashbat Suzuki, Jeremy Vollen:
Maximum Flow is Fair: A Network Flow Approach to Committee Voting. CoRR abs/2406.14907 (2024) - 2023
- Hossein Alipour:
Instance Space Analysis for the Maximum Flow Problem. University of Melbourne, Parkville, Victoria, Australia, 2023 - Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva:
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow. Commun. ACM 66(12): 85-92 (2023) - Shang-Hua Teng:
Technical Perspective: Maximum Flow through a Network: A Storied Problem and a Groundbreaking Solution. Commun. ACM 66(12): 84 (2023) - Hossein Alipour, Mario Andrés Muñoz, Kate Smith-Miles:
Enhanced instance space analysis for the maximum flow problem. Eur. J. Oper. Res. 304(2): 411-428 (2023) - Wei Wei, Pengpeng Wang, Yabo Dong:
Maximum flow acceleration by traversing tree based two-boundary graph contraction. Expert Syst. Appl. 225: 120151 (2023) - Wei Qi, Yiting Xu, Zongqian Gao, Zhiou Xu, Zhenzhen Huang, Shuo Xiao:
Mobile chargers scheduling algorithm for maximum data flow in wireless sensor networks. J. Comput. Methods Sci. Eng. 23(3): 1573-1587 (2023) - Oliverio Cruz-Mejia, Adam N. Letchford:
A survey on exact algorithms for the maximum flow and minimum-cost flow problems. Networks 82(2): 167-176 (2023)
skipping 696 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-24 18:11 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint