|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 95 occurrences of 80 keywords
|
|
|
Results
Found 110 publication records. Showing 110 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
104 | 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 |
99 | 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 |
81 | 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 |
78 | 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 |
|
74 | 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 |
72 | 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 |
|
64 | 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 |
|
64 | 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 |
|
63 | 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 |
|
62 | 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 |
52 | 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 |
|
44 | 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 |
44 | 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 |
44 | 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 |
44 | 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 |
44 | 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 |
44 | 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 |
44 | 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 |
44 | 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 |
40 | 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 |
|
38 | 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 |
|
38 | 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 |
|
38 | 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 |
|
38 | Richard G. Ogier |
Flow Optimization in Dynamic and Continuous Networks (Polymatroids, Submodular, Max-Flow Min-Cut) ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1985 |
RDF |
|
37 | 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 |
|
36 | Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor |
A general approach to online network optimization problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 2(4), pp. 640-660, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Online network optimization, group Steiner, multi-cuts, competitive analysis, facility location, randomized rounding |
33 | Ishai Menache, Shie Mannor, Nahum Shimkin |
Q-Cut - Dynamic Discovery of Sub-goals in Reinforcement Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECML ![In: Machine Learning: ECML 2002, 13th European Conference on Machine Learning, Helsinki, Finland, August 19-23, 2002, Proceedings, pp. 295-306, 2002, Springer, 3-540-44036-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | 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 |
|
33 | 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 |
|
33 | Andreas Lochbihler |
A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks with Applications to Probability Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 66(4), pp. 585-610, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
33 | Nada Alzaben, Daniel W. Engels |
End-to-End Routing in SDN Controllers Using Max-Flow Min-Cut Route Selection Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICACT ![In: 24th International Conference on Advanced Communication Technology, ICACT 2022, Pyeongchang, Korea, February 13-16, 2022, pp. 461-467, 2022, IEEE, 979-11-88428-08-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
33 | Nada Alzaben, Daniel W. Engels |
End-to-End Routing Algorithm Based on Max-Flow Min-Cut in SDN Controllers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICACT ![In: 24th International Conference on Advanced Communication Technology, ICACT 2022, Pyeongchang, Korea, February 13-16, 2022, pp. 1405-1413, 2022, IEEE, 979-11-88428-08-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
33 | Nengkun Yu |
Quantum Max-Flow Min-Cut theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2110.00905, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
33 | Matthew Broussard, Bala Krishnamoorthy |
A Tight Max-Flow Min-Cut Duality Theorem for Non-Linear Multicommodity Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2107.04252, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
33 | Ahmad Abdi, Gérard Cornuéjols |
The max-flow min-cut property and ±1-resistant sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 289, pp. 455-476, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
33 | Nada Alzaben, Daniel W. Engels |
End-to-End Routing in SDN Controllers Using Max-Flow Min-Cut Route Selection Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICACT ![In: 23rd International Conference on Advanced Communication Technology, ICACT 2021, Pyeongchang, South Korea, February 7-10, 2021, pp. 461-467, 2021, IEEE, 979-11-88428-06-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
33 | Andreas Lochbihler |
A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITP ![In: 12th International Conference on Interactive Theorem Proving, ITP 2021, June 29 to July 1, 2021, Rome, Italy (Virtual Conference)., pp. 25:1-25:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-188-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
33 | Lifan Zhou, Yang Lan, Yu Xia, Shengrong Gong |
Extended Phase Unwrapping Max-Flow/Min-Cut Algorithm for Multibaseline SAR Interferograms Using a Two-Stage Programming Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sensors ![In: Sensors 20(2), pp. 375, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
33 | Søren Riis, Maximilien Gadouleau |
Max-flow min-cut theorems on dispersion and entropy measures for communication networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 267, pp. 49-73, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
33 | Chung Chan, Ali Al-Bashabsheh, Da Sun Handason Tam, Chao Zhao |
Finding Better Web Communities in Digraphs via Max-Flow Min-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, July 7-12, 2019, pp. 410-414, 2019, IEEE, 978-1-5386-9291-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
33 | Varun Ramesh, Shivanee Nagarajan, Jason J. Jung, Saswati Mukherjee |
Max-flow min-cut algorithm with application to road networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Concurr. Comput. Pract. Exp. ![In: Concurr. Comput. Pract. Exp. 29(11), 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
33 | Sunil Mathew, John N. Mordeson |
Directed Fuzzy Networks as a Model to Illicit Flows and Max Flow Min Cut Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
New Math. Nat. Comput. ![In: New Math. Nat. Comput. 13(3), pp. 219-229, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
33 | Kensuke Otsuki, Yusuke Kobayashi 0001, Kazuo Murota |
Improved max-flow min-cut algorithms in a Circular Disk Failure Model with application to a road network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 248(2), pp. 396-403, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
33 | Andreas Lochbihler |
A Formal Proof of the Max-Flow Min-Cut Theorem for Countable Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Formal Proofs ![In: Arch. Formal Proofs 2016, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
33 | Varun Ramesh, Shivanee Nagarajan, Saswati Mukherjee |
Max-flow Min-cut Algorithm in Spark with Application to Road Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BDTA ![In: Big Data Technologies and Applications - 7th International Conference, BDTA 2016, Seoul, South Korea, November 17-18, 2016, Proceedings, pp. 12-22, 2016, Springer, 978-3-319-58966-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
33 | Ali Gaber, Karim G. Seddik, Ayman Y. Elezabi |
PMUs placement with max-flow min-cut communication constraint in smart grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WCNC ![In: IEEE Wireless Communications and Networking Conference, WCNC 2016, Doha, Qatar, April 3-6, 2016, pp. 1-6, 2016, IEEE, 978-1-4673-9814-5. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
33 | Shawn X. Cui, Michael H. Freedman, Or Sattath, Richard Stong, Greg Minton |
Quantum Max-flow/Min-cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1508.04644, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
33 | Qinghong Zhong, Ying Wang 0002, Luoming Meng, Ailing Xiao, Hongjing Zhang |
A max-flow/min-cut theory based multi-domain virtual network splitting mechanism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APNOMS ![In: 17th Asia-Pacific Network Operations and Management Symposium, APNOMS 2015, Busan, South Korea, August 19-21, 2015, pp. 392-395, 2015, IEEE, 978-4-8855-2296-3. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
33 | Oliver Kosut |
Max-flow min-cut for power system security index computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAM ![In: IEEE 8th Sensor Array and Multichannel Signal Processing Workshop, SAM 2014, A Coruna, Spain, June 22-25, 2014, pp. 61-64, 2014, IEEE, 978-1-4799-1481-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
33 | Yusuke Kobayashi 0001, Kensuke Otsuki |
Max-flow min-cut theorem and faster algorithms in a circular disk failure model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: 2014 IEEE Conference on Computer Communications, INFOCOM 2014, Toronto, Canada, April 27 - May 2, 2014, pp. 1635-1643, 2014, IEEE, 978-14799-3360-0. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
33 | Robert Ghrist, Sanjeevi Krishnan |
A topological max-flow-min-cut theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GlobalSIP ![In: IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013, Austin, TX, USA, December 3-5, 2013, pp. 815-818, 2013, IEEE, 978-1-4799-0248-4. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
33 | Ying Liu, K. D. Prathapasinghe Dharmawansa, Matthew R. McKay |
Max-flow min-cut outage characterization of dual-hop relay channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Allerton Conference ![In: 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012, Allerton Park & Retreat Center, Monticello, IL, USA, October 1-5, 2012, pp. 1659-1665, 2012, IEEE, 978-1-4673-4537-8. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
33 | S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari |
A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 57(5), pp. 3005-3015, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
33 | Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Amitai Perlstein, Philipp Sprüssel |
The Max-Flow Min-Cut theorem for countable networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 101(1), pp. 1-17, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
33 | Ananda S. Chowdhury, Suchendra M. Bhandarkar, Robert W. Robinson, Jack C. Yu, Tianming Liu 0001 |
Detection of hairline mandibular fracture using max-flow min-cut and Kolmogorov-Smirnov distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISBI ![In: Proceedings of the 8th IEEE International Symposium on Biomedical Imaging: From Nano to Macro, ISBI 2011, March 30 - April 2, 2011, Chicago, Illinois, USA, pp. 1962-1965, 2011, IEEE, 978-1-4244-4128-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
33 | Maximilien Gadouleau, Søren Riis |
Max-flow min-cut theorem for Rényi entropy in communication networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31 - August 5, 2011, pp. 603-607, 2011, IEEE, 978-1-4577-0596-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
33 | Amir Massoudi, Arcot Sowmya, Katarina Mele, Dimitri Semenovich |
Employing temporal information for cell segmentation using max-flow/min-cut in phase-contrast video microscopy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMBC ![In: 33rd Annual International Conference of the IEEE Engineering in Medicine and Biology Society, EMBC 2011, Boston, MA, USA, August 30 - Sept. 3, 2011, pp. 5985-5988, 2011, IEEE, 978-1-4244-4121-1. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
33 | José Martínez-Bernal, Edwin O'Shea, Rafael H. Villarreal |
Ehrhart Clutters: Regularity and Max-Flow Min-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 17(1), 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
33 | Maximilien Gadouleau, Søren Riis |
Max-Flow Min-Cut Theorems for Communication Networks Based on Equational Logic ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1012.5224, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
33 | S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari |
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010, pp. 1209-1226, 2010, SIAM, 978-0-89871-701-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
33 | Rui A. Costa, João Barros |
A Max-Flow Min-Cut Theorem with Applications in Small Worlds and Dual Radio Networks ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0809.1379, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
33 | Masahiro Hachimori, M. Nakamura |
The max-flow min-cut property of two-dimensional affine convex geometries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 308(9), pp. 1674-1689, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Mohammad Taghi Hajiaghayi, Tom Leighton |
On the max-flow min-cut ratio for directed multicommodity flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 352(1-3), pp. 318-321, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Matthew W. Turek, Daniel Freedman |
Multiscale Modeling and Constraints for Max-flow/Min-cut Problems in Computer Vision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR Workshops ![In: IEEE Conference on Computer Vision and Pattern Recognition, CVPR Workshops 2006, New York, NY, USA, 17-22 June, 2006, pp. 180, 2006, IEEE Computer Society, 0-7695-2646-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | 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) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 86(2), pp. 273-279, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | Phil Diamond |
A fuzzy max-flow min-cut theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fuzzy Sets Syst. ![In: Fuzzy Sets Syst. 119(1), pp. 139-148, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
33 | Frank Thomson Leighton, Satish Rao |
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 46(6), pp. 787-832, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
muticommocity flow, routing, approximation algorithms, graph partitioning, divide and conquer, VLSI layout, maximum flow, minimum cut, graph bisection |
33 | Manfred Padberg, Ting-Yi Sung |
An analytic symmetrization of max flow-min cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 165-166, pp. 531-545, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
33 | Serge A. Plotkin, Éva Tardos |
Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 15(3), pp. 425-434, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
33 | Serge A. Plotkin, Éva Tardos |
Improved bounds on the max-flow min-cut ratio for multicommodity flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA, pp. 691-697, 1993, ACM, 0-89791-591-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
33 | Monique Laurent, Antonio Sassano |
A characterization of knapsacks with the max-flow- - min-cut property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 11(2), pp. 105-110, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
33 | Dan Bienstock |
Some Generalized Max-Flow Min-Cut Problems in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 16(2), pp. 310-333, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
33 | Fan T. Tseng, Klaus Truemper |
A decomposition of the matroids with the max-flow min-cut property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 15(2-3), pp. 329-364, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
33 | Paul D. Seymour |
The matroids with the max-flow min-cut property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 23(2-3), pp. 189-222, 1977. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
|
33 | Alan J. Hoffman |
A generalization of max flow - min cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 6(1), pp. 352-359, 1974. The full citation details ...](Pics/full.jpeg) |
1974 |
DBLP DOI BibTeX RDF |
|
31 | 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 |
|
31 | 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 |
|
31 | 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 |
|
31 | Andrew Delong, Yuri Boykov |
A Scalable graph-cut algorithm for N-D grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR ![In: 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2008), 24-26 June 2008, Anchorage, Alaska, USA, 2008, IEEE Computer Society, 978-1-4244-2242-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | 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 |
29 | Mala L. Radhakrishnan, Sara L. Su |
Dead-End Elimination as a Heuristic for Min-Cut Image Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings of the International Conference on Image Processing, ICIP 2006, October 8-11, Atlanta, Georgia, USA, pp. 2429-2432, 2006, IEEE, 1-4244-0480-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Sidharth Jaggi, Peter Sanders 0001, Philip A. Chou, Michelle Effros, Sebastian Egner, Kamal Jain, Ludo M. G. M. Tolhuizen |
Polynomial time algorithms for multicast network code construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(6), pp. 1973-1982, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Peter Sanders 0001, Sebastian Egner, Ludo M. G. M. Tolhuizen |
Polynomial time algorithms for network information flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003), pp. 286-294, 2003, ACM, 1-58113-661-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
communication, multicasting, randomized algorithm, finite field, coding, linear algebra, derandomization, network information theory |
28 | Elliot Anshelevich, David Kempe 0001, Jon M. Kleinberg |
Stability of load balancing algorithms in dynamic adversarial systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 399-406, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Songqiao Han, Shensheng Zhang, Yong Zhang 0033 |
A Generic Software Partitioning Algorithm for Pervasive Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WASA ![In: Wireless Algorithms, Systems, and Applications, First International Conference, WASA 2006, Xi'an, China, August 15-17, 2006, Proceedings, pp. 57-68, 2006, Springer, 3-540-37189-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Algorithm, Pervasive computing, Software partitioning |
28 | 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 |
|
27 | 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 |
|
26 | Jose Joaquin Garcia-Luna-Aceves, Zheng Wang 0006, Hamid R. Sadjadpour, Shirish S. Karande |
Optimal Unicast Capacity of Random Geometric Graphs: Impact of Multipacket Transmission and Reception. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 27(7), pp. 1180-1191, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | James R. Lee, Anastasios Sidiropoulos |
On the geometry of graphs with a forbidden minor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 245-254, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
forbidden minors, geometry of graphs, embeddings |
24 | Amir F. Dana, Radhika Gowaikar, Ravi Palanki, Babak Hassibi, Michelle Effros |
Capacity of wireless erasure networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(3), pp. 789-804, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Debdeep Chatterjee, Tan F. Wong, Tat M. Lok |
Cooperative Transmission in a Wireless Cluster Based on Flow Management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WCNC ![In: WCNC 2008, IEEE Wireless Communications & Networking Conference, March 31 2008 - April 3 2008, Las Vegas, Nevada, USA, Conference Proceedings, pp. 30-35, 2008, IEEE, 978-1-4244-1997-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Naveen Garg 0001, Rohit Khandekar |
Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 500-, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Rupesh S. Shelar, Sachin S. Sapatnekar |
BDD decomposition for delay oriented pass transistor logic synthesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Very Large Scale Integr. Syst. ![In: IEEE Trans. Very Large Scale Integr. Syst. 13(8), pp. 957-970, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Aitor del Coso, Christian Ibars |
Achievable rates for the AWGN channel with multiple parallel relays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 8(5), pp. 2524-2534, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Hanife Kebapci, Berrin A. Yanikoglu, Gozde B. Unal |
Plant image retrieval using color and texture features. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCIS ![In: The 24th International Symposium on Computer and Information Sciences, ISCIS 2009, 14-16 September 2009, North Cyprus, pp. 82-87, 2009, IEEE. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Reinhard Klette, Ruyi Jiang, Sandino Morales, Tobi Vaudrey |
Discrete Driver Assistance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Mathematical Morphology and Its Application to Signal and Image Processing, 9th International Symposium, ISMM 2009, Groningen, The Netherlands, August 24-27, 2009 Proceedings, pp. 1-12, 2009, Springer, 978-3-642-03612-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
distance transform, Discrete mathematics, driver assistance, lane detection, stereo analysis |
19 | Jesús Gómez-Vilardebó, Ana I. Pérez-Neira |
Bounds on Maximum Rate-Per-Energy for Orthogonal AWGN Multiple-Relay Channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 7(11-1), pp. 4238-4247, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Yang Wang 0014, Hung Q. Ngo 0001, Xiaohong Jiang 0001 |
Strictly Nonblocking Function-Cast d-Ary Multi-Log Networks under Fanout and Crosstalk Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICC ![In: Proceedings of IEEE International Conference on Communications, ICC 2008, Beijing, China, 19-23 May 2008, pp. 5407-5411, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Jarno Nousiainen, Jorma T. Virtamo, Pasi E. Lassila |
Forwarding capacity of an infinite wireless network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MSWiM ![In: Proceedings of the 11th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2008, Vancouver, British Columbia, Canada, October 27-31, 2008, pp. 177-184, 2008, ACM, 978-1-60558-235-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
forwarding capacity, wireless multihop networks, flow networks |
19 | David Tse |
Information theory of wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CISS ![In: 42nd Annual Conference on Information Sciences and Systems, CISS 2008, Princeton, NJ, USA, 19-21 March 2008, 2008, IEEE, 978-1-4244-2246-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 110 (100 per page; Change: ) Pages: [ 1][ 2][ >>] |
|