The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase st-mincut (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1984-1998 (18) 1999-2004 (18) 2005-2008 (18) 2009-2019 (15) 2020-2023 (7)
Publication types (Num. hits)
article(28) inproceedings(48)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 50 occurrences of 47 keywords

Results
Found 76 publication records. Showing 76 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
106Shun-Wen Cheng, Kuo-Hsing Cheng ENISLE: an intuitive heuristic nearly optimal solution for mincut and ratio mincut partitioning. Search on Bibsonomy ISCAS (5) The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
106Sung Kwon Kim An efficient parallel algorithm for the planar mincut linear arrangement problem for trees. Search on Bibsonomy ISPAN The full citation details ... 1997 DBLP  DOI  BibTeX  RDF planar mincut, parallel algorithm, NP-complete, trees (mathematics), EREW PRAM, polynomial-time solvable
78Shantanu Dutt, Wenyong Deng Cluster-aware iterative improvement techniques for partitioning large VLSI circuits. Search on Bibsonomy ACM Trans. Design Autom. Electr. Syst. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF VLSI circuit partitioning, mincut, physical design/layout, Clusters, iterative-improvement
71Vladimir Lipets Bounds on Mincut for Cayley Graphs over Abelian Groups. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mincut, Algorithms, Graph theory, Combinatorial optimization, Bounds, Cayley graphs, Bisection
62Jason Cong, Sung Kyu Lim Retiming-based timing analysis with an application to mincut-based global placement. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
61Shantanu Dutt, Halim Theny Partitioning around roadblocks: tackling constraints with intermediate relaxations. Search on Bibsonomy ICCAD The full citation details ... 1997 DBLP  DOI  BibTeX  RDF balance-ratio constraint, benefit estimation, blind relaxation, constraint-driven partitioning, estimate-driven relaxation, mincut partitioning, probabilistic gain, violating moves
44Pushmeet Kohli, Philip H. S. Torr Dynamic Graph Cuts for Efficient Inference in Markov Random Fields. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Dynamic graph cuts, st-mincut, Markov Random Fields, Energy Minimization, Video segmentation, Maximum flow
34Yajie Miao, Chunping Li Topical Analysis for Identification of Web Communities. Search on Bibsonomy Australasian Conference on Artificial Intelligence The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Link Analysis, Web Community, Topical Analysis, Web Structure Mining
34David Bañeres, Jordi Cortadella, Michael Kishinevsky Dominator-based partitioning for delay optimization. Search on Bibsonomy ACM Great Lakes Symposium on VLSI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF logic design, timing optimization, logic partitioning
34Pushmeet Kohli, Philip H. S. Torr Effciently Solving Dynamic Markov Random Fields Using Graph Cuts. Search on Bibsonomy ICCV The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
34Francisco J. Estrada, Allan D. Jepson Quantitative Evaluation of a Novel Image Segmentation Algorithm. Search on Bibsonomy CVPR (2) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
34L. Sunil Chandran, N. S. Narayanaswamy On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts. Search on Bibsonomy COCOON The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
34Avrim Blum, John D. Lafferty, Mugizi Robert Rwebangira, Rajashekar Reddy Semi-supervised learning using randomized mincuts. Search on Bibsonomy ICML The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
34Shantanu Dutt, Hasan Arslan, Halim Theny Partitioning using second-order information and stochastic-gainfunctions. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
34Kanad Chakraborty, Natesan Venkateswaran Congestion Mitigation During Placement. Search on Bibsonomy Great Lakes Symposium on VLSI The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
34Shantanu Dutt, Halim Theny Partitioning using second-order information and stochastic-gain functions. Search on Bibsonomy ISPD The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
27Chi Thang Duong, Thanh Tam Nguyen, Trung-Dung Hoang, Hongzhi Yin, Matthias Weidlich 0001, Quoc Viet Hung Nguyen Deep MinCut: Learning Node Embeddings by Detecting Communities. Search on Bibsonomy Pattern Recognit. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
27Surender Baswana, Koustav Bhanja Vital Edges for (s, t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
27Surender Baswana, Shiv Kumar Gupta 0001, Till Knollmann Mincut Sensitivity Data Structures for the Insertion of an Edge. Search on Bibsonomy Algorithmica The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
27Jason Li Deterministic Mincut in Almost-Linear Time. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
27Jason Li 0006 Deterministic mincut in almost-linear time. Search on Bibsonomy STOC The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
27Avah Banerjee, Guoli Ding Online Mincut: Advice, Randomization and More. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
27Surender Baswana, Shiv Kumar Gupta 0001, Till Knollmann Mincut Sensitivity Data Structures for the Insertion of an Edge. Search on Bibsonomy ESA The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
27Filippo Maria Bianchi, Daniele Grattarola, Cesare Alippi Mincut pooling in Graph Neural Networks. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
27Alexander Shekhovtsov, Václav Hlavác A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-Relabel. Search on Bibsonomy Int. J. Comput. Vis. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
27Victor S. Lempitsky, Andrew Blake 0001, Carsten Rother Branch-and-Mincut: Global Optimization for Image Segmentation with High-Level Priors. Search on Bibsonomy J. Math. Imaging Vis. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
27Debasree Maity, Indrajit Saha, Ujjwal Maulik, Dariusz Plewczynski Soft Computing Approach for VLSI Mincut Partitioning: The State of the Arts. Search on Bibsonomy SocProS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
27Alexander Shekhovtsov, Václav Hlavác A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-Relabel Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
27Se Yong Park, Anant Sahai An algebraic mincut-maxflow theorem. Search on Bibsonomy ISIT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
27Alexander Shekhovtsov, Václav Hlavác A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-Relabel. Search on Bibsonomy EMMCVPR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
27Eduardo Sáenz-de-Cabezón, Henry P. Wynn Mincut ideals of two-terminal networks. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
27Valentin Polishchuk, Mikko Sysikaski Improved approximations for robust mincut and shortest path Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
27Sang Hyun Park 0004, Soochahn Lee, Hackjoon Shim, Il Dong Yun, Sang Uk Lee, Kyoung Ho Lee, Heung Sik Kang, Joon Koo Han Fully automatic 3-D segmentation of knee bone compartments by iterative local branch-and-mincut on MR images from osteoarthritis initiative (OAI). Search on Bibsonomy ICIP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
27Wei Feng 0005, Lei Xie 0001, Zhi-Qiang Liu Multicue Graph Mincut for Image Segmentation. Search on Bibsonomy ACCV (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
27Gerhard Reinelt, Dirk Oliver Theis, Klaus Michael Wenger Computing finest mincut partitions of a graph and application to routing problems. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
27Victor S. Lempitsky, Andrew Blake 0001, Carsten Rother Image Segmentation by Branch-and-Mincut. Search on Bibsonomy ECCV (4) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
27Kuo-Hsing Cheng, Shun-Wen Cheng Influences of minimum cut plane properties on the mincut circuit partitioning problems. Search on Bibsonomy ICECS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
27Thomas Epping, Winfried Hochstättler, Marco E. Lübbecke MaxFlow-MinCut Duality for a Paint Shop Problem. Search on Bibsonomy OR The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
27Roderic D. M. Page Modified Mincut Supertrees. Search on Bibsonomy WABI The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
27Kuo-Hsing Cheng, Shun-Wen Cheng A study on the relationship between initial node-edge pairs entropy and mincut circuit partitioning. Search on Bibsonomy ICECS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
27P. Sadayappan, Fikret Erçal, J. Ramanujam Partitioning Graphs on Message-Passing Machines by Pairwise Mincut. Search on Bibsonomy Inf. Sci. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
27Masahiro Sano, Shintaro Shimogori, Fumiyasu Hirose Acceleration of mincut partitioning using hardware CAD accelerator TP5000. Search on Bibsonomy ASP-DAC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
27Harold N. Gabow Perfect Arborescence Packing in Preflow Mincut Graphs. Search on Bibsonomy SODA The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
27Edmund Ihler, Dorothea Wagner, Frank Wagner 0001 Modeling Hypergraphs by Graphs with the Same Mincut Properties. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
27Shin'ichi Wakabayashi, Hiroshi Kusumoto, Hideki Mishima, Tetsushi Koide, Noriyoshi Yoshida Gate Array Placement Based on Mincut, Partitioning with Path Delay Constraints. Search on Bibsonomy ISCAS The full citation details ... 1993 DBLP  BibTeX  RDF
27Achim G. Hoffmann Towards optimizing global MinCut partitioning. Search on Bibsonomy EURO-DAC The full citation details ... 1991 DBLP  BibTeX  RDF
27Fikret Erçal, J. Ramanujam, P. Sadayappan Task Allocation onto a Hypercube by Recursive Mincut Bipartitioning. Search on Bibsonomy J. Parallel Distributed Comput. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
27Fikret Erçal, J. Ramanujam, P. Sadayappan Task allocation onto a hypercube by recursive mincut bipartitioning. Search on Bibsonomy C³P The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
27Carl Sechen, Dahe Chen An improved objective function for mincut circuit partitioning. Search on Bibsonomy ICCAD The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
27Eitan M. Gurari, Ivan Hal Sudborough Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem. Search on Bibsonomy J. Algorithms The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
27Tung-Chieh Chen, Tien-Chang Hsu, Zhe-Wei Jiang, Yao-Wen Chang NTUplace: a ratio partitioning based placement algorithm for large-scale mixed-size designs. Search on Bibsonomy ISPD The full citation details ... 2005 DBLP  DOI  BibTeX  RDF mincut, ratio cut, placement
27Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya Partitioning VLSI Floorplans by Staircase Channels for Global Routing. Search on Bibsonomy VLSI Design The full citation details ... 1998 DBLP  DOI  BibTeX  RDF maxflow-mincut, algorithms, complexity, partitioning, NP-completeness, Global routing
17Pushmeet Kohli, Lubor Ladicky, Philip H. S. Torr Robust Higher Order Potentials for Enforcing Label Consistency. Search on Bibsonomy Int. J. Comput. Vis. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Discrete energy minimization, Markov and conditional random fields, Object recognition and segmentation
17Kalin Kolev, Maria Klodt, Thomas Brox, Daniel Cremers Continuous Global Optimization in Multiview 3D Reconstruction. Search on Bibsonomy Int. J. Comput. Vis. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Continuous global minimization, Multiview 3D reconstruction, Convex optimization
17Yuri Rabinovich On Average Distortion of Embedding Metrics into the Line. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Average distortion, Metric embeddings
17Dirk Sudholt Memetic algorithms with variable-depth search to overcome local optima. Search on Bibsonomy GECCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Kernighan-Lin, variable-depth search, simulated annealing, combinatorial optimization, memetic algorithms, runtime analysis
17Ilan Newman, Yuri Rabinovich Hard Metrics from Cayley Graphs of Abelian Groups. Search on Bibsonomy STACS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
17Pushmeet Kohli, M. Pawan Kumar, Philip H. S. Torr P3 & Beyond: Solving Energies with Higher Order Cliques. Search on Bibsonomy CVPR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
17Julia Chuzhoy, Sanjeev Khanna Polynomial flow-cut gaps and hardness of directed cut problems. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF concurrent flow, directed multicut, directed sparsest cut, flow-cut gaps, hardness of approximation, multicommodity flow
17Kalin Kolev, Maria Klodt, Thomas Brox, Selim Esedoglu, Daniel Cremers Continuous Global Optimization in Multiview 3D Reconstruction. Search on Bibsonomy EMMCVPR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
17Dmitrij Schlesinger Exact Solution of Permuted Submodular MinSum Problems. Search on Bibsonomy EMMCVPR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
17Zhong-Zhen Wu, Shih-Chieh Chang Multiple wire reconnections based on implication flow graph. Search on Bibsonomy ACM Trans. Design Autom. Electr. Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF global flow optimization (GFO), implication flow graph (IFG), mandatory assignment, multiple wire reconnection, redundant wire, Automatic test pattern generation (ATPG)
17Sudipta N. Sinha, Marc Pollefeys Multi-View Reconstruction Using Photo-consistency and Exact Silhouette Constraints: A Maximum-Flow Formulation. Search on Bibsonomy ICCV The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
17Enrique Mérida Casermeiro, Domingo López-Rodríguez Graph Partitioning via Recurrent Multivalued Neural Networks. Search on Bibsonomy IWANN The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
17Shlomo Moran, Satish Rao, Sagi Snir Using Semi-definite Programming to Enhance Supertree Resolvability. Search on Bibsonomy WABI The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
17Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd Edge-Disjoint Paths in Planar Graphs. Search on Bibsonomy FOCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
17Mongkol Ekpanyapong, Sung Kyu Lim Performance-driven global placement via adaptive network characterization. Search on Bibsonomy ASP-DAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
17Yuri Rabinovich On average distortion of embedding metrics into the line and into L1. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF average metric distortion, planar metrics, finite metric spaces
17Rajeev Murgai Efficient global fanout optimization algorithms. Search on Bibsonomy ASP-DAC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
17Shantanu Dutt, Wenyong Deng Probability-based approaches to VLSI circuit partitioning. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
17Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov Can recursive bisection alone produce routable placements? Search on Bibsonomy DAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
17Stephen L. Hary, Füsun Özgüner Precedence-Constrained Task Allocation onto Point-to-Point Networks for Pipelined Execution. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF real-time systems, Task scheduling, direct networks, message scheduling, pipeline scheduling
17Charles J. Alpert, Jen-Hsin Huang, Andrew B. Kahng Multilevel circuit partitioning. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
17Raymond Lo, Sun Chan, James C. Dehnert, Ross A. Towle Aggregate Operation Movement: A Min-Cut Approach to Global Code Motion. Search on Bibsonomy Euro-Par, Vol. II The full citation details ... 1996 DBLP  DOI  BibTeX  RDF global code motion, software pipelining, network flow, superscalar, minimum cut, global scheduling
17Manfred Wiegers The k-section of Treewidth Restricted Graphs. Search on Bibsonomy MFCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
17Victor Y. Pan, John H. Reif Extension of the Parallel Nested Dissection Algorithm to Path Algebra Problems. Search on Bibsonomy FSTTCS The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #76 of 76 (100 per page; Change: )
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