The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Max-flow/min-cut (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1974-1995 (15) 1996-2003 (16) 2004-2006 (22) 2007-2008 (16) 2009-2011 (16) 2012-2020 (15) 2021-2024 (10)
Publication types (Num. hits)
article(56) incollection(1) inproceedings(52) phdthesis(1)
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
104Jianmin Li, John Lillis, Chung-Kuan Cheng Linear decomposition algorithm for VLSI design applications. Search on Bibsonomy ICCAD The full citation details ... 1995 DBLP  DOI  BibTeX  RDF linear placement, max-flow min-cut, eigenvector, circuit partitioning
99Xijin Yan, Jun Yang, Zhen Zhang 0010 An outer bound for multisource multisink network coding with minimum cost consideration. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 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
81Frank Thomson Leighton, Satish Rao An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms Search on Bibsonomy FOCS The full citation details ... 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
78José M. Bioucas-Dias, Gonçalo Valadão Phase unwrapping: a new max-flow/min-cut based approach. Search on Bibsonomy ICIP (2) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
74Xue-Bin Liang Matrix games in the multicast networks: maximum information flows with network switching. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 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
72Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman Single source multiroute flows and cuts on uniform capacity networks. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  BibTeX  RDF
64Hannah Honghua Yang, Martin D. F. Wong Balanced partitioning. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
64Maren Martens, S. Thomas McCormick A Polynomial Algorithm for Weighted Abstract Flow. Search on Bibsonomy IPCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
63Yuri Boykov, Vladimir Kolmogorov An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
62Yuanning Li, Yonghong Tian 0001, Jingjing Yang, Ling-Yu Duan, Wen Gao 0001 Video retargeting with multi-scale trajectory optimization. Search on Bibsonomy Multimedia Information Retrieval The full citation details ... 2010 DBLP  DOI  BibTeX  RDF max-flow/min-cut, multi-scale trajectory optimization, spatio-temporal saliency, video retargeting
52Bertrand Guenin A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property. Search on Bibsonomy IPCO The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
44Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin Maximum Flow Problem. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Minimum cut problem, Augmenting path algorithm, Preflow-push algorithm, Max-flow min-cut theorem, Network, Maximum flow problem
44Antonin Chambolle, Jérôme Darbon On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows. Search on Bibsonomy Int. J. Comput. Vis. The full citation details ... 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
44Liang-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 IEEE Trans. Inf. Theory The full citation details ... 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
44Jingtao Yu, Pingyi Fan, Kai Cai Capacity analysis of maximal flow in ad hoc networks. Search on Bibsonomy IWCMC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF max-flow min-cut, routing, network coding, random graph, network capacity
44Georg Baier, Ekkehard Köhler, Martin Skutella The k-Splittable Flow Problem. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Max-flow min-cut, Approximation algorithm, Network flow, Unsplittable flow
44Ioannis C. Avramopoulos, Miltiades E. Anagnostou Optimal Component Configuration and Component Routing. Search on Bibsonomy IEEE Trans. Mob. Comput. The full citation details ... 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
44Jon M. Kleinberg Single-Source Unsplittable Flow. Search on Bibsonomy FOCS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF max-flow min-cut, scheduling, load balancing, generalization, NP-hard, unsplittable flow, machine scheduling, capacity constraints
44Philip N. Klein, Ajit Agrawal, R. Ravi 0001, Satish Rao Approximation through Multicommodity Flow Search on Bibsonomy FOCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF minimum deletion, max-flow-min-cut theorem, approximation algorithms, multicommodity flow
40Honghua Yang, D. F. Wong 0001 Efficient network flow based min-cut balanced partitioning. Search on Bibsonomy ICCAD The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
38Philip 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 Comb. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
38Hiroshi Nagamochi, Toshihide Ibaraki On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
38Klaus Truemper Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes. Search on Bibsonomy Math. Oper. Res. The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
38Richard G. Ogier Flow Optimization in Dynamic and Continuous Networks (Polymatroids, Submodular, Max-Flow Min-Cut) Search on Bibsonomy 1985   RDF
37Jittat Fakcharoenphol, Kunal Talwar An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor A general approach to online network optimization problems. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Online network optimization, group Steiner, multi-cuts, competitive analysis, facility location, randomized rounding
33Ishai Menache, Shie Mannor, Nahum Shimkin Q-Cut - Dynamic Discovery of Sub-goals in Reinforcement Learning. Search on Bibsonomy ECML The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
33G. Gayathri, Sunil Mathew, John N. Mordeson Max-flow min-cut theorem for directed fuzzy incidence networks. Search on Bibsonomy J. Appl. Math. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
33Matthew Broussard, Bala Krishnamoorthy A tight max-flow min-cut duality theorem for nonlinear multicommodity flows. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
33Andreas Lochbihler A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks with Applications to Probability Theory. Search on Bibsonomy J. Autom. Reason. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
33Nada Alzaben, Daniel W. Engels End-to-End Routing in SDN Controllers Using Max-Flow Min-Cut Route Selection Algorithm. Search on Bibsonomy ICACT The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
33Nada Alzaben, Daniel W. Engels End-to-End Routing Algorithm Based on Max-Flow Min-Cut in SDN Controllers. Search on Bibsonomy ICACT The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
33Nengkun Yu Quantum Max-Flow Min-Cut theorem. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
33Matthew Broussard, Bala Krishnamoorthy A Tight Max-Flow Min-Cut Duality Theorem for Non-Linear Multicommodity Flows. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
33Ahmad Abdi, Gérard Cornuéjols The max-flow min-cut property and ±1-resistant sets. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
33Nada Alzaben, Daniel W. Engels End-to-End Routing in SDN Controllers Using Max-Flow Min-Cut Route Selection Algorithm. Search on Bibsonomy ICACT The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
33Andreas Lochbihler A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks. Search on Bibsonomy ITP The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
33Lifan 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 Sensors The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
33Søren Riis, Maximilien Gadouleau Max-flow min-cut theorems on dispersion and entropy measures for communication networks. Search on Bibsonomy Inf. Comput. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
33Chung Chan, Ali Al-Bashabsheh, Da Sun Handason Tam, Chao Zhao Finding Better Web Communities in Digraphs via Max-Flow Min-Cut. Search on Bibsonomy ISIT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
33Varun Ramesh, Shivanee Nagarajan, Jason J. Jung, Saswati Mukherjee Max-flow min-cut algorithm with application to road networks. Search on Bibsonomy Concurr. Comput. Pract. Exp. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
33Sunil Mathew, John N. Mordeson Directed Fuzzy Networks as a Model to Illicit Flows and Max Flow Min Cut Theorem. Search on Bibsonomy New Math. Nat. Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
33Kensuke 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 Eur. J. Oper. Res. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
33Andreas Lochbihler A Formal Proof of the Max-Flow Min-Cut Theorem for Countable Networks. Search on Bibsonomy Arch. Formal Proofs The full citation details ... 2016 DBLP  BibTeX  RDF
33Varun Ramesh, Shivanee Nagarajan, Saswati Mukherjee Max-flow Min-cut Algorithm in Spark with Application to Road Networks. Search on Bibsonomy BDTA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
33Ali Gaber, Karim G. Seddik, Ayman Y. Elezabi PMUs placement with max-flow min-cut communication constraint in smart grids. Search on Bibsonomy WCNC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
33Shawn X. Cui, Michael H. Freedman, Or Sattath, Richard Stong, Greg Minton Quantum Max-flow/Min-cut. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
33Qinghong 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 APNOMS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
33Oliver Kosut Max-flow min-cut for power system security index computation. Search on Bibsonomy SAM The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
33Yusuke Kobayashi 0001, Kensuke Otsuki Max-flow min-cut theorem and faster algorithms in a circular disk failure model. Search on Bibsonomy INFOCOM The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
33Robert Ghrist, Sanjeevi Krishnan A topological max-flow-min-cut theorem. Search on Bibsonomy GlobalSIP The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
33Ying Liu, K. D. Prathapasinghe Dharmawansa, Matthew R. McKay Max-flow min-cut outage characterization of dual-hop relay channels. Search on Bibsonomy Allerton Conference The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
33S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
33Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Amitai Perlstein, Philipp Sprüssel The Max-Flow Min-Cut theorem for countable networks. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
33Ananda 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 ISBI The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
33Maximilien Gadouleau, Søren Riis Max-flow min-cut theorem for Rényi entropy in communication networks. Search on Bibsonomy ISIT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
33Amir 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 EMBC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
33José Martínez-Bernal, Edwin O'Shea, Rafael H. Villarreal Ehrhart Clutters: Regularity and Max-Flow Min-Cut. Search on Bibsonomy Electron. J. Comb. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
33Maximilien Gadouleau, Søren Riis Max-Flow Min-Cut Theorems for Communication Networks Based on Equational Logic Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
33S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks. Search on Bibsonomy SODA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
33Rui A. Costa, João Barros A Max-Flow Min-Cut Theorem with Applications in Small Worlds and Dual Radio Networks Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
33Masahiro Hachimori, M. Nakamura The max-flow min-cut property of two-dimensional affine convex geometries. Search on Bibsonomy Discret. Math. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
33Mohammad Taghi Hajiaghayi, Tom Leighton On the max-flow min-cut ratio for directed multicommodity flows. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
33Matthew W. Turek, Daniel Freedman Multiscale Modeling and Constraints for Max-flow/Min-cut Problems in Computer Vision. Search on Bibsonomy CVPR Workshops The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
33Bertrand Guenin A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
33Phil Diamond A fuzzy max-flow min-cut theorem. Search on Bibsonomy Fuzzy Sets Syst. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
33Frank Thomson Leighton, Satish Rao Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Search on Bibsonomy J. ACM The full citation details ... 1999 DBLP  DOI  BibTeX  RDF muticommocity flow, routing, approximation algorithms, graph partitioning, divide and conquer, VLSI layout, maximum flow, minimum cut, graph bisection
33Manfred Padberg, Ting-Yi Sung An analytic symmetrization of max flow-min cut. Search on Bibsonomy Discret. Math. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
33Serge A. Plotkin, Éva Tardos Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows. Search on Bibsonomy Comb. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
33Serge A. Plotkin, Éva Tardos Improved bounds on the max-flow min-cut ratio for multicommodity flows. Search on Bibsonomy STOC The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
33Monique Laurent, Antonio Sassano A characterization of knapsacks with the max-flow- - min-cut property. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
33Dan Bienstock Some Generalized Max-Flow Min-Cut Problems in the Plane. Search on Bibsonomy Math. Oper. Res. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
33Fan T. Tseng, Klaus Truemper A decomposition of the matroids with the max-flow min-cut property. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
33Paul D. Seymour The matroids with the max-flow min-cut property. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 1977 DBLP  DOI  BibTeX  RDF
33Alan J. Hoffman A generalization of max flow - min cut. Search on Bibsonomy Math. Program. The full citation details ... 1974 DBLP  DOI  BibTeX  RDF
31José M. Bioucas-Dias, Gonçalo Valadão Phase Unwrapping via Graph Cuts. Search on Bibsonomy IEEE Trans. Image Process. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
31Olivier Juan, Yuri Boykov Capacity Scaling for Graph Cuts in Vision. Search on Bibsonomy ICCV The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
31Huiqun Liu, Martin D. F. Wong Network-flow-based multiway partitioning with area and pin constraints. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
31Andrew Delong, Yuri Boykov A Scalable graph-cut algorithm for N-D grids. Search on Bibsonomy CVPR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
30Andrew V. Goldberg, Alexander V. Karzanov Maximum skew-symmetric flows and matchings. Search on Bibsonomy Math. Program. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF skew-symmetric graph, matching, network flow, b-matching
29Mala L. Radhakrishnan, Sara L. Su Dead-End Elimination as a Heuristic for Min-Cut Image Segmentation. Search on Bibsonomy ICIP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
29Sidharth 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 IEEE Trans. Inf. Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
29Peter Sanders 0001, Sebastian Egner, Ludo M. G. M. Tolhuizen Polynomial time algorithms for network information flow. Search on Bibsonomy SPAA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF communication, multicasting, randomized algorithm, finite field, coding, linear algebra, derandomization, network information theory
28Elliot Anshelevich, David Kempe 0001, Jon M. Kleinberg Stability of load balancing algorithms in dynamic adversarial systems. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
28Songqiao Han, Shensheng Zhang, Yong Zhang 0033 A Generic Software Partitioning Algorithm for Pervasive Computing. Search on Bibsonomy WASA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Algorithm, Pervasive computing, Software partitioning
28Kazuo Iwama Classic and Quantum Network Coding. Search on Bibsonomy SWAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
27José M. Bioucas-Dias, Gonçalo Valadão Phase Unwrapping via Graph Cuts. Search on Bibsonomy IbPRIA (1) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
26Jose 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 IEEE J. Sel. Areas Commun. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
24James R. Lee, Anastasios Sidiropoulos On the geometry of graphs with a forbidden minor. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF forbidden minors, geometry of graphs, embeddings
24Amir F. Dana, Radhika Gowaikar, Ravi Palanki, Babak Hassibi, Michelle Effros Capacity of wireless erasure networks. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
23Debdeep Chatterjee, Tan F. Wong, Tat M. Lok Cooperative Transmission in a Wireless Cluster Based on Flow Management. Search on Bibsonomy WCNC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
23Naveen Garg 0001, Rohit Khandekar Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
21Rupesh S. Shelar, Sachin S. Sapatnekar BDD decomposition for delay oriented pass transistor logic synthesis. Search on Bibsonomy IEEE Trans. Very Large Scale Integr. Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
19Aitor del Coso, Christian Ibars Achievable rates for the AWGN channel with multiple parallel relays. Search on Bibsonomy IEEE Trans. Wirel. Commun. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
19Hanife Kebapci, Berrin A. Yanikoglu, Gozde B. Unal Plant image retrieval using color and texture features. Search on Bibsonomy ISCIS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
19Reinhard Klette, Ruyi Jiang, Sandino Morales, Tobi Vaudrey Discrete Driver Assistance. Search on Bibsonomy ISMM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF distance transform, Discrete mathematics, driver assistance, lane detection, stereo analysis
19Jesús Gómez-Vilardebó, Ana I. Pérez-Neira Bounds on Maximum Rate-Per-Energy for Orthogonal AWGN Multiple-Relay Channels. Search on Bibsonomy IEEE Trans. Wirel. Commun. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Yang 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 ICC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Jarno Nousiainen, Jorma T. Virtamo, Pasi E. Lassila Forwarding capacity of an infinite wireless network. Search on Bibsonomy MSWiM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF forwarding capacity, wireless multihop networks, flow networks
19David Tse Information theory of wireless networks. Search on Bibsonomy CISS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 110 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license