|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 224 occurrences of 177 keywords
|
|
|
Results
Found 387 publication records. Showing 387 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
53 | Yasuhito Asano, Takao Nishizeki, Masashi Toyoda |
Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WISE ![In: Web Information Systems Engineering - WISE 2005, 6th International Conference on Web Information Systems Engineering, New York, NY, USA, November 20-22, 2005, Proceedings, pp. 1-14, 2005, Springer, 3-540-30017-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
48 | Zhenjiang Li, Yao Yu, Xiaojun Hei, Danny H. K. Tsang |
A Unified Framework for Sub-stream Scheduling in P2P Hybrid Streaming Systems and How to Do Better?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networking ![In: NETWORKING 2009, 8th International IFIP-TC 6 Networking Conference, Aachen, Germany, May 11-15, 2009. Proceedings, pp. 728-741, 2009, Springer, 978-3-642-01398-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
pull-push, max-flow, min-cost flow, hybrid, P2P streaming |
43 | Xijin Yan, Jun Yang, Zhen Zhang 0010 |
An outer bound for multisource multisink network coding with minimum cost consideration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(6), pp. 2373-2385, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
K-pairs transmission, max-flow min-cut bound, multisource multisink network, network sharing bound, three-layer network, network coding, side information |
43 | Jianmin Li, John Lillis, Chung-Kuan Cheng |
Linear decomposition algorithm for VLSI design applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1995 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1995, San Jose, California, USA, November 5-9, 1995, pp. 223-228, 1995, IEEE Computer Society / ACM, 0-8186-7213-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
linear placement, max-flow min-cut, eigenvector, circuit partitioning |
41 | Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman |
Single source multiroute flows and cuts on uniform capacity networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 855-863, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
41 | Masilamani Vedhanayagam, Kamala Krithivasan |
A Min-Cost-Max-Flow Based Algorithm for Reconstructing Binary Image from Two Projections Using Similar Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCIA ![In: Combinatorial Image Analysis, 12th International Workshop, IWCIA 2008, Buffalo, NY, USA, April 7-9, 2008. Proceedings, pp. 408-419, 2008, Springer, 978-3-540-78274-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
binary matrix reconstruction, min cost integral max flow problem, computed tomography, discrete tomography |
40 | Yuri Boykov, Vladimir Kolmogorov |
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 26(9), pp. 1124-1137, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
39 | Xue-Bin Liang |
Matrix games in the multicast networks: maximum information flows with network switching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(6), pp. 2433-2466, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
achievable information rate regions, matrix games, max-flow min-cut theorems, maximum information flows, multisource multicast networks, network switching, route packings, switching gaps, game theory, network coding, multicast routes, set-covering problems |
38 | Joseph S. B. Mitchell |
On Maximum Flows in Polyhedral Domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Fourth Annual Symposium on Computational Geometry, Urbana-Champaign, IL, USA, June 6-8, 1988, pp. 341-351, 1988, ACM, 0-89791-270-5. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
38 | Antonin Chambolle, Jérôme Darbon |
On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. ![In: Int. J. Comput. Vis. 84(3), pp. 288-307, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Crystalline and anisotropic mean curvature flow, Max-flow/min-cut, Parametric max-flow algorithms, Total variation, Submodular functions, Variational approaches |
37 | José M. Bioucas-Dias, Gonçalo Valadão |
Phase unwrapping: a new max-flow/min-cut based approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP (2) ![In: Proceedings of the 2005 International Conference on Image Processing, ICIP 2005, Genoa, Italy, September 11-14, 2005, pp. 77-80, 2005, IEEE, 0-7803-9134-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Rohit Khandekar, Satish Rao, Umesh V. Vazirani |
Graph partitioning using single commodity flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 56(4), pp. 19:1-19:15, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Edge-separator, single commodity max-flow, sparse cut, spectral method |
37 | Rohit Khandekar, Satish Rao, Umesh V. Vazirani |
Graph partitioning using single commodity flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 385-390, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
edge-separator, single commodity max-flow, sparse cut, spectral method |
37 | Frank Thomson Leighton, Satish Rao |
An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 422-431, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
max-flow min-cut theorem, minimum quotient separators, 1/3-2/3 separators, VLSI layout area, approximation algorithms, distributed networks, bifurcators, crossing number, multicommodity flow problems, optimal approximation |
36 | Julia Chuzhoy, Sanjeev Khanna |
Polynomial flow-cut gaps and hardness of directed cut problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 179-188, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
concurrent flow, directed multicut, directed sparsest cut, flow-cut gaps, hardness of approximation, multicommodity flow |
34 | Chun-Gi Lyuh, Taewhan Kim |
High-level synthesis for low power based on network flow method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Very Large Scale Integr. Syst. ![In: IEEE Trans. Very Large Scale Integr. Syst. 11(3), pp. 364-375, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Sourav Kumar Dandapat, Bivas Mitra, Niloy Ganguly, Romit Roy Choudhury |
Fair bandwidth allocation in wireless network using max-flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCOMM ![In: Proceedings of the ACM SIGCOMM 2010 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, New Delhi, India, August 30 -September 3, 2010, pp. 407-408, 2010, ACM, 978-1-4503-0201-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
association control, max-flow, fairness |
32 | Yuri Boykov, Vladimir Kolmogorov |
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMMCVPR ![In: Energy Minimization Methods in Computer Vision and Pattern Recognition, Third International Workshop, EMMCVPR 2001, Sophia Antipolis, France, September 3-5, 2001, Proceedings, pp. 359-374, 2001, Springer, 3-540-42523-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
32 | Teofilo F. Gonzalez, Shashishekhar Kurki-Gowdara |
An approximation algorithm for the via placement problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 8(3), pp. 219-228, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
31 | Austin Armbruster, Michael R. Gosnell, Bruce M. McMillin, Mariesa L. Crow |
Power Transmission Control Using Distributed Max Flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COMPSAC (1) ![In: 29th Annual International Computer Software and Applications Conference, COMPSAC 2005, Edinburgh, Scotland, UK, July 25-28, 2005. Volume 1, pp. 256-263, 2005, IEEE Computer Society, 0-7695-2413-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
FT Algorithms, FT Communication, Fault Injection, maximum flow, power system |
31 | Maren Martens, S. Thomas McCormick |
A Polynomial Algorithm for Weighted Abstract Flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings, pp. 97-111, 2008, Springer, 978-3-540-68886-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Amir Abboud, Jason Li 0006, Debmalya Panigrahi, Thatchaphol Saranurak |
All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, pp. 2204-2212, 2023, IEEE, 979-8-3503-1894-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
27 | Yuanning Li, Yonghong Tian 0001, Jingjing Yang, Ling-Yu Duan, Wen Gao 0001 |
Video retargeting with multi-scale trajectory optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Multimedia Information Retrieval ![In: Proceedings of the 11th ACM SIGMM International Conference on Multimedia Information Retrieval, MIR 2010, Philadelphia, Pennsylvania, USA, March 29-31, 2010, pp. 45-54, 2010, ACM, 978-1-60558-815-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
max-flow/min-cut, multi-scale trajectory optimization, spatio-temporal saliency, video retargeting |
27 | Masilamani Vedhanayagam, Kamala Krithivasan, K. G. Subramanian 0001, Ang Miin Huey |
Efficient Algorithms for Reconstruction of 2D-Arrays from Extended Parikh Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISVC (2) ![In: Advances in Visual Computing, 4th International Symposium, ISVC 2008, Las Vegas, NV, USA, December 1-3, 2008. Proceedings, Part II, pp. 1137-1146, 2008, Springer, 978-3-540-89645-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Parikh mapping, extended Parikh mapping, Min-Cost Max-Flow problem, 2D-array reconstruction, Formal Languages |
27 | Lorenzo Orecchia, Leonard J. Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi |
On partitioning graphs via single commodity flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 461-470, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
edge-separator, single-commodity max-flow, graph partitioning, spectral method, sparsest cut, matrix exponential |
27 | Ioannis C. Avramopoulos, Miltiades E. Anagnostou |
Optimal Component Configuration and Component Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Mob. Comput. ![In: IEEE Trans. Mob. Comput. 1(4), pp. 303-312, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
component allocation, component mobility, multiterminal cuts, max flow—min cut, mixed binary integer programming, Mobile agents, reconfiguration, NP-hard problems |
27 | Man-Fai Yu, Joel Darnauer, Wayne Wei-Ming Dai |
Interchangeable pin routing with application to package layout. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1996 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1996, San Jose, CA, USA, November 10-14, 1996, pp. 668-673, 1996, IEEE Computer Society / ACM, 0-8186-7597-7. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
BGA, all-angle wiring, interchangeable pin routing, min-cost max-flow heuristic, multiple layers, octilinear wiring, package layout, pin redistribution, prerouted nets, rectilinear wiring, test fixture routing, triangulated routing network, CAD, NP-complete, ASIC, circuit layout CAD, speed, PGA, input output, routing problems |
27 | Stavros G. Kolliopoulos, Clifford Stein 0001 |
Improved Approximation Algorithms for Unsplittable Flow Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 426-435, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
26 | Oktay Günlük |
A New Min-Cut Max-Flow Ratio for Multicommodity Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 54-66, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
26 | Hannah Honghua Yang, Martin D. F. Wong |
Balanced partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(12), pp. 1533-1540, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
25 | Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd |
Non-Interfering Network Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '92, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992, Proceedings, pp. 245-257, 1992, Springer, 3-540-55706-7. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
24 | Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat |
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 605-614, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Gomory-Hu tree, cut tree, steiner edge connectivity, edge connectivity, min cut |
24 | Ana-Maria Popescu, Oren Etzioni, Henry A. Kautz |
Towards a theory of natural language interfaces to databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IUI ![In: Proceedings of the 8th International Conference on Intelligent User Interfaces, IUI 2003, Miami, FL, USA, January 12-15, 2003, pp. 327, 2003, ACM, 1-58113-586-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
reliability, database, natural language interface |
22 | Timothy Gatzke, Cindy Grimm |
Feature Detection Using Curvature Maps and the Min-cut/Max-flow Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GMP ![In: Geometric Modeling and Processing - GMP 2006, 4th International Conference, Pittsburgh, PA, USA, July 26-28, 2006, Proceedings, pp. 578-584, 2006, Springer, 3-540-36711-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | S. A. Moghaddam, Nasser Masoumi, Caro Lucas |
A Stochastic Power-Supply Noise Reduction Technique Using Max-Flow Algorithm and Decoupling Capacitance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWSOC ![In: Proceedings of the 5th IEEE International Workshop on System-on-Chip for Real-Time Applications (IWSOC 2005), 20-24 July 2004, Banff, Alberta, Canada, pp. 265-269, 2005, IEEE Computer Society, 0-7695-2403-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Indra Geys, Thomas P. Koninckx, Luc Van Gool |
Fast Interpolated Cameras by Combining a GPU based Plane Sweep with a Max-Flow Regularisation Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
3DPVT ![In: 2nd International Symposium on 3D Data Processing, Visualization and Transmission (3DPVT 2004), 6-9 September 2004, Thessaloniki, Greece, pp. 534-541, 2004, IEEE Computer Society, 0-7695-2223-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Monaldo Mastrolilli |
Notes on Max Flow Time Minimization with Controllable Processing Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 71(4), pp. 375-386, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Scheduling, approximation algorithms, parallel machines, controllable processing times |
22 | Monaldo Mastrolilli |
Scheduling to Minimize Max Flow Time: Offline and Online Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings, pp. 49-60, 2003, Springer, 3-540-40543-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | Bertrand Guenin |
A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 188-193, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Satoru Iwata 0001, S. Thomas McCormick, Maiko Shigeno |
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 259-272, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
20 | Andrew V. Goldberg, Alexander V. Karzanov |
Maximum skew-symmetric flows and matchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 100(3), pp. 537-568, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
skew-symmetric graph, matching, network flow, b-matching |
19 | Xiaoqing Liu, Olga Veksler, Jagath Samarabandu |
Order-Preserving Moves for Graph-Cut-Based Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 32(7), pp. 1182-1196, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
max-flow, geometric class labeling, SVM, Energy minimization, graph cuts, shape prior |
19 | Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin |
Maximum Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 2009-2020, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Minimum cut problem, Augmenting path algorithm, Preflow-push algorithm, Max-flow min-cut theorem, Network, Maximum flow problem |
19 | Franz-Josef Brandenburg, Mao-cheng Cai |
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings, pp. 4-15, 2009, Springer, 978-3-642-02269-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
extended networks, lossy and gainy arcs, max-flow, unit-loss networks, shortest path, NP-hard |
19 | Hua Yu, Prasant Mohapatra, Xin Liu 0002 |
Channel Assignment and Link Scheduling in Multi-Radio Multi-Channel Wireless Mesh Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mob. Networks Appl. ![In: Mob. Networks Appl. 13(1-2), pp. 169-185, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
max-flow graph, linear programming, wireless mesh networks, interference, channel assignment, link scheduling |
19 | Vladimir Kolmogorov, Carsten Rother |
Minimizing Nonsubmodular Functions with Graph Cuts-A Review. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 29(7), pp. 1274-1279, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
quadratic pseudo-Boolean optimization, min cut/max flow, texture restoration, Markov Random Fields, Energy minimization |
19 | Liang-Liang Xie, Panganamala R. Kumar |
On the path-loss attenuation regime for positive cost and linear scaling of transport capacity in wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(6), pp. 2313-2328, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
capacity of wireless networks, cut-set bound, max-flow min-cut bound, multiuser information theory, ad hoc networks, wireless networks, scaling laws, transport capacity, network information theory |
19 | Jingtao Yu, Pingyi Fan, Kai Cai |
Capacity analysis of maximal flow in ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCMC ![In: Proceedings of the International Conference on Wireless Communications and Mobile Computing, IWCMC 2006, Vancouver, British Columbia, Canada, July 3-6, 2006, pp. 1225-1228, 2006, ACM, 1-59593-306-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
max-flow min-cut, routing, network coding, random graph, network capacity |
19 | Georg Baier, Ekkehard Köhler, Martin Skutella |
The k-Splittable Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 42(3-4), pp. 231-248, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Max-flow min-cut, Approximation algorithm, Network flow, Unsplittable flow |
19 | Palash Sarkar 0001, Paul J. Schellenberg |
Construction of Symmetric Balanced Squares with Blocksize More than One. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 30(3), pp. 235-280, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
symmetric Latin square, symmetric balanced square, min cut-max flow theorem, combinatorial design |
19 | Jon M. Kleinberg |
Single-Source Unsplittable Flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 68-77, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
max-flow min-cut, scheduling, load balancing, generalization, NP-hard, unsplittable flow, machine scheduling, capacity constraints |
19 | Sivan Toledo |
Maximizing Non-Linear Concave Functions in Fixed Dimension ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 676-685, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
parametric Euclidean traveling salesman problem, fixed dimension, piece wise polynomial concave function, concave polynomial, input point, nonlinear parametric problems, parametric max flow problem, parametric minimum s-t distance, parametric spanning tree, NP-hard problems, convex set, arithmetic operations, polynomial functions |
19 | Philip N. Klein, Ajit Agrawal, R. Ravi 0001, Satish Rao |
Approximation through Multicommodity Flow ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pp. 726-737, 1990, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
minimum deletion, max-flow-min-cut theorem, approximation algorithms, multicommodity flow |
18 | Pushmeet Kohli, Philip H. S. Torr |
Dynamic Graph Cuts for Efficient Inference in Markov Random Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 29(12), pp. 2079-2088, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Dynamic graph cuts, st-mincut, Markov Random Fields, Energy Minimization, Video segmentation, Maximum flow |
18 | Joseph Cheriyan, Howard J. Karloff, Yuval Rabani |
Approximating Directed Multicuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 25(3), pp. 251-269, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C20, 90C27, 05C85, 68W25 |
18 | Pushmeet Kohli, Philip H. S. Torr |
Effciently Solving Dynamic Markov Random Fields Using Graph Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: 10th IEEE International Conference on Computer Vision (ICCV 2005), 17-20 October 2005, Beijing, China, pp. 922-929, 2005, IEEE Computer Society, 0-7695-2334-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Honghua Yang, D. F. Wong 0001 |
Efficient network flow based min-cut balanced partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1994 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1994, San Jose, California, USA, November 6-10, 1994, pp. 50-55, 1994, IEEE Computer Society / ACM, 0-89791-690-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
18 | Claus-Peter Schnorr |
Multiterminal Network Flow and Connectivity in Unsymmetrical Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, Fifth Colloquium, Udine, Italy, July 17-21, 1978, Proceedings, pp. 425-439, 1978, Springer, 3-540-08860-1. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
|
18 | Juntong Luo, Scott Sallinen, Matei Ripeanu |
Going with the Flow: Real-Time Max-Flow on Asynchronous Dynamic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GRADES-NDA@SIGMOD ![In: Proceedings of the 6th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), Seattle, WA, USA, 18 June 2023, pp. 5:1-5:11, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Tao Zhang 0041, Hongyan Li 0001, Jiandong Li 0001, Shun Zhang 0003, Haiying Shen |
A Dynamic Combined Flow Algorithm for the Two-Commodity Max-Flow Problem Over Delay-Tolerant Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 17(12), pp. 7879-7893, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Chin-Chia Jane, Yih-Wenn Laih |
Distribution and reliability evaluation of max-flow in dynamic multi-state flow networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 259(3), pp. 1045-1053, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
18 | Peter Lammich, S. Reza Sefidgar |
Flow Networks and the Min-Cut-Max-Flow Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Formal Proofs ![In: Arch. Formal Proofs 2017, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
18 | Guillaume Guex, François Bavaud |
Flow-Based Dissimilarities: Shortest Path, Commute Time, Max-Flow and Free Energy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECDA ![In: Data Science, Learning by Latent Structures, and Knowledge Discovery [revised versions of selected papers presented during the European Conference on Data Analysis (ECDA 2013), Luxembourg, July 2013]., pp. 101-111, 2013, Springer, 978-3-662-44982-0. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Philip N. Klein, Satish Rao, Ajit Agrawal, R. Ravi 0001 |
An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 15(2), pp. 187-202, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
18 | Hiroshi Nagamochi, Toshihide Ibaraki |
On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 31(6), pp. 279-285, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
18 | Klaus Truemper |
Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 12(1), pp. 72-96, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
18 | Richard G. Ogier |
Flow Optimization in Dynamic and Continuous Networks (Polymatroids, Submodular, Max-Flow Min-Cut) ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1985 |
RDF |
|
17 | Kazuo Iwama |
Classic and Quantum Network Coding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings, pp. 3-4, 2006, Springer, 3-540-35753-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
17 | Sébastien Roy 0001, Venu Govindu |
MRF Solutions for Probabilistic Optical Flow Formulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR ![In: 15th International Conference on Pattern Recognition, ICPR'00, Barcelona, Spain, September 3-8, 2000., pp. 7053-7059, 2000, IEEE Computer Society, 0-7695-0750-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
16 | Toshihiko Horiike, Youhei Takahashi, Tetsuji Kuboyama, Hiroshi Sakamoto |
Extracting Research Communities by Improved Maximum Flow Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES (2) ![In: Knowledge-Based and Intelligent Information and Engineering Systems, 13th International Conference, KES 2009, Santiago, Chile, September 28-30, 2009, Proceedings, Part II, pp. 472-479, 2009, Springer, 978-3-642-04591-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | José M. Bioucas-Dias, Gonçalo Valadão |
Phase Unwrapping via Graph Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 16(3), pp. 698-709, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Olivier Juan, Yuri Boykov |
Capacity Scaling for Graph Cuts in Vision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: IEEE 11th International Conference on Computer Vision, ICCV 2007, Rio de Janeiro, Brazil, October 14-20, 2007, pp. 1-8, 2007, IEEE Computer Society, 978-1-4244-1630-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Dragan Petrovic, Kannan Ramchandran, Jan M. Rabaey |
Overcoming untuned radios in wireless networks with network coding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(6), pp. 2649-2657, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
untuned radios, sensor networks, network coding |
16 | José M. Bioucas-Dias, Gonçalo Valadão |
Phase Unwrapping via Graph Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IbPRIA (1) ![In: Pattern Recognition and Image Analysis, Second Iberian Conference, IbPRIA 2005, Estoril, Portugal, June 7-9, 2005, Proceedings, Part I, pp. 360-367, 2005, Springer, 3-540-26153-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Yan Feng, Dinesh P. Mehta, Hannah Honghua Yang |
Constrained floorplanning using network flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 23(4), pp. 572-580, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Yan Feng, Dinesh P. Mehta, Hannah Honghua Yang |
Constrained "Modern" Floorplanning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of the 2003 International Symposium on Physical Design, ISPD 2003, Monterey, CA, USA, April 6-9, 2003, pp. 128-135, 2003, ACM, 1-58113-650-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
floorplanning, network flow, rectilinear polygons |
16 | Jittat Fakcharoenphol, Kunal Talwar |
An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings, pp. 36-46, 2003, Springer, 3-540-40770-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
16 | David Hartvigsen |
Generalized Max Flows and Augmenting Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings, pp. 185-197, 1995, Springer, 3-540-59408-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Huiqun Liu, Martin D. F. Wong |
Network-flow-based multiway partitioning with area and pin constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17(1), pp. 50-59, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
14 | Daniel Kosmas, Thomas C. Sharkey, John E. Mitchell 0001, Kayse Lee Maass, Lauren Martin |
Multi-period max flow network interdiction with restructuring for disrupting domestic sex trafficking networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 335(2), pp. 797-860, April 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
14 | G. Gayathri, Sunil Mathew, John N. Mordeson |
Max-flow min-cut theorem for directed fuzzy incidence networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Math. Comput. ![In: J. Appl. Math. Comput. 70(1), pp. 149-173, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
14 | Lorenzo Balzotti, Paolo Giulio Franciosa |
How vulnerable is an undirected planar graph with respect to max flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 83(3), pp. 570-586, April 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
14 | Matthew Broussard, Bala Krishnamoorthy |
A tight max-flow min-cut duality theorem for nonlinear multicommodity flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 47(3), pp. 54, April 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
14 | Zhongtian He, Shang-En Huang, Thatchaphol Saranurak |
Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024, pp. 1465-1502, 2024, SIAM, 978-1-61197-791-2. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
14 | Ohad Trabelsi |
(Almost) Ruling Out SETH Lower Bounds for All-Pairs Max-Flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.04667, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Zhongtian He, Shang-En Huang, Thatchaphol Saranurak |
Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.10706, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Patrick M. Jensen, Niels Jeppesen, Anders B. Dahl, Vedrana Andersen Dahl |
Review of Serial and Parallel Min-Cut/Max-Flow Algorithms for Computer Vision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 45(2), pp. 2310-2329, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Trust Tawanda, Philimon Nyamugure, Elias Munapo, Santosh Kumar |
Extreme Min - Cut Max - Flow Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Appl. Metaheuristic Comput. ![In: Int. J. Appl. Metaheuristic Comput. 14(1), pp. 1-16, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Ekaterina Merkurjev |
Similarity graph-based max-flow and duality approaches for semi-supervised data classification and image segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Mach. Learn. Cybern. ![In: Int. J. Mach. Learn. Cybern. 14(12), pp. 4285-4310, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Lorenzo Balzotti, Paolo Giulio Franciosa |
How Vulnerable is an Undirected Planar Graph with Respect to Max Flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity - 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings, pp. 82-96, 2023, Springer, 978-3-031-30447-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Tobias Friedrich 0001, Davis Issac, Nikhil Kumar 0001, Nadym Mallek, Ziena Zeif |
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, pp. 1325-1334, 2023, ACM, 978-1-4503-9913-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Lorenzo Balzotti |
Non-crossing shortest paths in planar graphs with applications to max flow, and path graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2023 |
RDF |
|
14 | Sangita Dhara, Sujoy Ghose, Raja Datta |
MFR - A Max-Flow-Based Routing for Future Interplanetary Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Aerosp. Electron. Syst. ![In: IEEE Trans. Aerosp. Electron. Syst. 58(6), pp. 5334-5350, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
14 | Sicong Pan, Hui Wei 0001 |
A Global Max-Flow-Based Multi-Resolution Next-Best-View Method for Reconstruction of 3D Unknown Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Robotics Autom. Lett. ![In: IEEE Robotics Autom. Lett. 7(2), pp. 714-721, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
14 | Yossi Peretz, Yigal Fischler |
A fast parallel max-flow algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Parallel Distributed Comput. ![In: J. Parallel Distributed Comput. 169, pp. 226-241, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
14 | Giorgio Ausiello, Lorenzo Balzotti, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini |
A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2204.10568, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
14 | Patrick M. Jensen, Niels Jeppesen, Anders B. Dahl, Vedrana Andersen Dahl |
Review of Serial and Parallel Min-Cut/Max-Flow Algorithms for Computer Vision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.00418, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
14 | Lorenzo Balzotti, Paolo Giulio Franciosa |
Max Flow Vitality of Edges and Vertices in Undirected Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2201.13099, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
14 | Tobias Friedrich 0001, Davis Issac, Nikhil Kumar 0001, Nadym Mallek, Ziena Zeif |
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.06267, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
14 | Moe Kayali, Dan Suciu |
Quasi-stable Coloring for Graph Compression: Approximating Max-Flow, Linear Programs, and Centrality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.11912, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 387 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ >>] |
|