Search results for "$k$-Cut"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
106	Julia Chuzhoy, Sanjeev Khanna	Polynomial flow-cut gaps and hardness of directed cut problems.	STOC	2007	DBLP DOI BibTeX RDF	concurrent flow, directed multicut, directed sparsest cut, flow-cut gaps, hardness of approximation, multicommodity flow
90	Julia Chuzhoy, Sanjeev Khanna	Polynomial flow-cut gaps and hardness of directed cut problems.	J. ACM	2009	DBLP DOI BibTeX RDF	Directed multicut, hardness of approximation, sparsest cut
78	WoongChul Choi, JinWoo Han, Byung Joon Park, Jiman Hong	BCTMA(Bi-directional Cut-Through Medium Access) Protocol for 802.11-Based Multi-hop Wireless Networks.	ISSADS	2005	DBLP DOI BibTeX RDF	Forward cut-through scheme, Backward cut-through scheme, BCTMA (Bi-directional Cut-Through Medium Access) protocol, DCF (Distributed Coordination Function), IEEE 802.11, Wireless multi-hop networks
75	Chandra Chekuri, Sudipto Guha, Joseph Naor	Approximating Steiner k-Cuts.	ICALP	2003	DBLP DOI BibTeX RDF	Multiway Cut, $k$-Cut, Steiner tree, minimum cut, primal-dual
74	Takehiro Ito, Marcin Kaminski 0001, Daniël Paulusma, Dimitrios M. Thilikos	Parameterizing Cut Sets in a Graph by the Number of Their Components.	ISAAC	2009	DBLP DOI BibTeX RDF
72	Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten	Complexity of the Min-Max (Regret) Versions of Cut Problems.	ISAAC	2005	DBLP DOI BibTeX RDF	min-max regret, s–t min cut, complexity, min cut, min-max
70	Hannah Honghua Yang, D. F. Wong 0001	New algorithms for min-cut replication in partitioned circuits.	ICCAD	1995	DBLP DOI BibTeX RDF	Hyper-MAMC, VLSI circuit partitioning, k-way partition, k-way partitioned digraph, min-cut replication, partitioned circuits, VLSI, optimal algorithm, circuit layout CAD, hypergraphs, VLSI layout, digraphs, circuit layout
68	Kazuhiro Takahashi, Kazuo Nakajima, Masayuki Terai, Koji Sato	Adaptive cut line selection in min-cut placement for large scale sea-of-gates arrays.	ICCAD	1994	DBLP DOI BibTeX RDF
64	Hannah Honghua Yang, Martin D. F. Wong	Optimal min-area min-cut replication in partitioned circuits.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1998	DBLP DOI BibTeX RDF
62	Olivier Hermant	Semantic Cut Elimination in the Intuitionistic Sequent Calculus.	TLCA	2005	DBLP DOI BibTeX RDF	intuitionistic sequent calculus, cut admissibility, cut elimination property, semantic, Kripke Structure, deduction modulo
62	Kai Brünnler	Atomic Cut Elimination for classical Logic.	CSL	2003	DBLP DOI BibTeX RDF	atomic cut, sequent calculus, cut elimination, natural deduction, classical logic
61	Mingyu Xiao 0001	Algorithms for Multiterminal Cuts.	CSR	2008	DBLP DOI BibTeX RDF	Multiterminal Cut, Graph Algorithm, Fixed Parameter Tractability, Multicut
60	Song Wang 0002, Jeffrey Mark Siskind	Image Segmentation with Ratio Cut - Supplemental Material.	IEEE Trans. Pattern Anal. Mach. Intell.	2003	DBLP DOI BibTeX RDF	Graph partitioning algorithms, cut ratio, cycle ratio, image segmentation, edge detection, machine vision, perceptual organization, perfect matching
60	Song Wang 0002, Jeffrey Mark Siskind	Image Segmentation with Ratio Cut.	IEEE Trans. Pattern Anal. Mach. Intell.	2003	DBLP DOI BibTeX RDF	Graph partitioning algorithms, cut ratio, cycle ratio, image segmentation, edge detection, machine vision, perceptual organization, perfect matching
60	Yoko Kamidoi, Shin'ichi Wakabayashi, Noriyoshi Yoshida	A Divide-and-Conquer Approach to the Minimum k-Way Cut Problem.	Algorithmica	2002	DBLP DOI BibTeX RDF	Minimum k -way cut, Maximum flow computation, Undirected weighted graph, Deterministic algorithm, Recursive structure
58	Teofilo F. Gonzalez, Toshio Murayama	Alhorithms for a Class of Min-Cut and Max-Cut Problem.	ISAAC	1992	DBLP DOI BibTeX RDF
57	Manfred Wamsler	On the selection of the mode cut-off number in component mode reduction.	Eng. Comput.	2009	DBLP DOI BibTeX RDF	Structural dynamics, Component mode reduction, Component mode synthesis, Mixed Guyan and modal reduction, Craig-Bampton method, Direct solution formulation, Modal solution formulation, Mode cut-off number, Cut-off frequency
55	Ryan O'Donnell, Yi Wu 0002	An optimal sdp algorithm for max-cut, and equally optimal long code tests.	STOC	2008	DBLP DOI BibTeX RDF	semidefinite programming, hardness of approximation, max-cut
55	Hanwen Guo, Minyong Shi, Zhiguo Hong, Rui Yang, Li Zhang	Virtual Artistic Paper-Cut.	Edutainment	2008	DBLP DOI BibTeX RDF	Subdivision Curve, Paper-Cut, NPR, SVG, Contour Extraction, Polygon Clipping
55	Julia Chuzhoy, Sanjeev Khanna	Hardness of cut problems in directed graphs.	STOC	2006	DBLP DOI BibTeX RDF	directed multicut, hardness of approximation, sparsest cut
55	Wai-Kei Mak, D. F. Wong 0001	Minimum replication min-cut partitioning.	ICCAD	1996	DBLP DOI BibTeX RDF	min-cut partitioning, circuit partitioning, logic replication
54	Alexandre X. Falcão, Paulo A. V. Miranda, Anderson Rocha 0001	A Linear-Time Approach for Image Segmentation Using Graph-Cut Measures.	ACIVS	2006	DBLP DOI BibTeX RDF
54	Matthias Elf, Carsten Gutwenger, Michael Jünger, Giovanni Rinaldi	Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS.	Computational Combinatorial Optimization	2001	DBLP DOI BibTeX RDF
51	Hans L. Bodlaender, Babette van Antwerpen-de Fluiter	Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two.	Algorithmica	2001	DBLP DOI BibTeX RDF	Minimum k -way cut, Maximum flow computation, Undirected weighted graph, Deterministic algorithm, Recursive structure
51	Tamal K. Dey, Kuiyu Li	Cut locus and topology from surface point data.	SCG	2009	DBLP DOI BibTeX RDF	cut locus, rips complex, surface point cloud, topology, differential geometry
51	Yong He 0003, Sixin Xu, Kejun Zhu, Ting Liu, Yue Li	A Genetic-Neural Method of Optimizing Cut-Off Grade and Grade of Crude Ore.	ISNN (2)	2008	DBLP DOI BibTeX RDF	Genetic-neural optimization, Cut-off grade, Grade of crude ore
51	David R. Karger, Clifford Stein 0001	A New Approach to the Minimum Cut Problem.	J. ACM	1996	DBLP DOI BibTeX RDF	parallel computing, randomized algorithm, graph algorithm, network reliability, minimum cut
50	Monique Laurent	Semidefinite Relaxations for Max-Cut.	The Sharpest Cut	2004	DBLP DOI BibTeX RDF
50	Hervé Kerivin, Ali Ridha Mahjoub, Charles Nocq	(1, 2)-Survivable Networks: Facets and Branch-and-Cut.	The Sharpest Cut	2004	DBLP DOI BibTeX RDF
49	Padmanabhan Soundararajan, Sudeep Sarkar	An In-Depth Study of Graph Partitioning Measures for Perceptual Organization.	IEEE Trans. Pattern Anal. Mach. Intell.	2003	DBLP DOI BibTeX RDF	grouping, graph partitioning, empirical evaluation, Perceptual organization, stochastic orders
49	Chandra Chekuri, Sanjeev Khanna	Algorithms for 2-Route Cut Problems.	ICALP (1)	2008	DBLP DOI BibTeX RDF
49	Alejandro Duran, Julita Corbalán, Eduard Ayguadé	An adaptive cut-off for task parallelism.	SC	2008	DBLP DOI BibTeX RDF
49	Subhash Khot, Nisheeth K. Vishnoi	The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1.	FOCS	2005	DBLP DOI BibTeX RDF
48	Yu G. Chen, Maria C. Yuang	An efficient terminal-pair reliability algorithm for network management.	LCN	1995	DBLP DOI BibTeX RDF	terminal-pair reliability, probabilistic reliability, path-based partition method, network reduction technique, cut-based partition algorithm, network reduction, performance evaluation, network management, computer network management, minimum cut, failure probabilities
47	Jiabing Wang, Hong Peng, Jing-Song Hu, Chuangxin Yang	A Graph Clustering Algorithm Based on Minimum and Normalized Cut.	International Conference on Computational Science (1)	2007	DBLP DOI BibTeX RDF	image segmentation, graph clustering, minimum cut, normalized cut
46	Hoang Tuy	Cutting Plane Methods for Global Optimization.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Inner approximation, Polyhedral annexation, Concavity cut, Intersection cut, Convexity cut, Nonlinear cut, Polyblock approximation, Monotonic optimization, Outer approximation, Cutting plane method
46	Qiusong Yang, Mingshu Li 0001	A cut-off approach for bounded verification of parameterized systems.	ICSE (1)	2010	DBLP DOI BibTeX RDF	cut-off, bounded model checking, parameterized system
46	Monia Giandomenico, Adam N. Letchford	Exploring the Relationship Between Max-Cut and Stable Set Relaxations.	Math. Program.	2006	DBLP DOI BibTeX RDF	Stable set problem, Polyhedral combinatorics, Max-cut problem
46	Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin	A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem.	Algorithmica	2004	DBLP DOI BibTeX RDF	Convex integer programming, Total unimodularity, Network flow, Minimum cut, Nonlinear integer programming
46	Reijer Grimbergen	Plausible Move Generation Using Move Merit Analysis with Cut-Off Thresholds in Shogi.	Computers and Games	2000	DBLP DOI BibTeX RDF	Plausible move generation, move merit analysis, cut-off thresholds, shogi
44	Reda Alhajj, Ashraf Elnagar	Multiagents to Separating Handwritten Connected Digits.	IEEE Trans. Syst. Man Cybern. Part A	2005	DBLP DOI BibTeX RDF
44	Padmanabhan Soundararajan, Sudeep Sarkar	Investigation of Measures for Grouping by Graph Partitioning.	CVPR (1)	2001	DBLP DOI BibTeX RDF
44	Jin Zhang, Lei Xie 0001, Wei Feng 0005, Yanning Zhang	A Subword Normalized Cut Approach to Automatic Story Segmentation of Chinese Broadcast News.	AIRS	2009	DBLP DOI BibTeX RDF
44	David Avis, Hiroshi Imai, Tsuyoshi Ito	Generating facets for the cut polytope of a graph by triangular elimination.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 52B12, 90C57, 05C99
44	Wai-Kei Mak, Martin D. F. Wong	Minimum replication min-cut partitioning.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1997	DBLP DOI BibTeX RDF
44	Kazuhiro Takahashi, Kazuo Nakajima, Masayuki Terai, Koji Sato	Min-cut placement with global objective functions for large scale sea-of-gates arrays.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1995	DBLP DOI BibTeX RDF
43	Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat	An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs.	STOC	2007	DBLP DOI BibTeX RDF	Gomory-Hu tree, cut tree, steiner edge connectivity, edge connectivity, min cut
42	Jianer Chen, Yang Liu 0002, Songjian Lu	An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem.	Algorithmica	2009	DBLP DOI BibTeX RDF	Multiway cut problem, Network flow, Fixed-parameter tractability, Minimum cut, Parameterized algorithm
42	Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino	Generating Cut Conjunctions in Graphs and Related Problems.	Algorithmica	2008	DBLP DOI BibTeX RDF	Cut conjunction, Cut generation, Graph, Matroid, Multicut
42	Ching-Yung Yang, Ja-Chen Lin	Color quantization by RWM-cut.	ICDAR	1995	DBLP DOI BibTeX RDF	RWM-cut, radius weighted mean cut, hierarchically divisive method, two-class partition, MSE quantization error, LBG algorithm, initial palette, full-color image, color palette, color image, image colour analysis, centroid, color quantization
42	Wei-Kuan Shih, Sun Wu, Yue-Sun Kuo	Unifying Maximum Cut and Minimum Cut of a Planar Graph.	IEEE Trans. Computers	1990	DBLP DOI BibTeX RDF	maximum cut, nonnegative edge weights, computational complexity, graph theory, planar graph, minimum cut
41	Young-Il Lee, Yong-Gi Kim	Comparison of fuzzy implication operators by means of fuzzy relational products used for intelligent local path-planning of AUVs.	Soft Comput.	2009	DBLP DOI BibTeX RDF	Autonomous underwater vehicles(AUVs), ?-Cut, Fuzzy relational products, Implication operator, Local path-planning
41	Mingyu Xiao 0001	An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts.	ISAAC	2008	DBLP DOI BibTeX RDF	k-Way Cut, Graph Algorithm, Divide-and-Conquer
41	Anand Bhalgat, Tanmoy Chakraborty 0001, Sanjeev Khanna	Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games.	EC	2010	DBLP DOI BibTeX RDF	cut games, party affiliation games, potential games, pure nash equilibrium, approximation algorithms
41	Dong Liu 0022, Weiyan Xing, Chunyuan Zhang, Rui Li 0051, Haiyan Li	Cut Sequence Set Generation for Fault Tree Analysis.	ICESS	2007	DBLP DOI BibTeX RDF	cut sequence set, sequential failure expression, fault tree analysis
41	Xujia Qin, Xinhua Yang, Hongbo Zheng	Implicit Surface Boolean Operations Based Cut-and-Paste Algorithm for Mesh Models.	ICAT	2006	DBLP DOI BibTeX RDF	mesh models, point models, implicit surface, Boolean operations, Cut-and-paste
41	Francesco Belardinelli, Peter Jipsen, Hiroakira Ono	Algebraic Aspects of Cut Elimination.	Stud Logica	2004	DBLP DOI BibTeX RDF	Algebraic Gentzen systems, finite model property, residuated lattices, cut elimination, substructural logics
41	Dvir Steiner, Anath Fischer	Finding and defining the generators of genus-n objects for constructing topological and cut graphs.	Vis. Comput.	2004	DBLP DOI BibTeX RDF	Cut graph, Longitude, Meridian, Topological graph, Shape classification
41	Francisco Gutiérrez, Blas C. Ruiz	Expansion Postponement via Cut Elimination in Sequent Calculi for Pure Type Systems.	ICALP	2003	DBLP DOI BibTeX RDF	pure type systems, expansion postponement, Track: B, cut elimination, sequent calculi
41	Christian Urban	Strong Normalisation for a Gentzen-like Cut-Elimination Procedure.	TLCA	2001	DBLP DOI BibTeX RDF	Recursive Path Ordering, Cut-Elimination, Explicit Substitution, Classical Logic
41	Wai-Kei Mak	Min-cut partitioning with functional replication for technology mapped circuits using minimum area overhead.	ISPD	2001	DBLP DOI BibTeX RDF	minimum cut, circuit partitioning, logic replication
41	Joseph Naor, Leonid Zosin	A 2-Approximation Algorithm for the Directed Multiway Cut Problem.	FOCS	1997	DBLP DOI BibTeX RDF	directed multiway cut problem, 2-approximation algorithm, multiway flow function, NP-complete, directed graphs, polynomial-time algorithm, approximation factor
41	Saumya K. Debray, David Scott Warren	Towards Banishing the Cut from Prolog.	IEEE Trans. Software Eng.	1990	DBLP DOI BibTeX RDF	impure language features, impure features, Prolog source programs, firstof, oneof, declarative readings, parallel evaluation strategies, purer programming style, logic programs, logic programming, static analysis, PROLOG, program transformations, nondeterminism, cut, language constructs, compile time
40	Nathan W. Brixius, Kurt M. Anstreicher	The Steinberg Wiring Problem.	The Sharpest Cut	2004	DBLP DOI BibTeX RDF
40	Günter M. Ziegler	Typical and Extremal Linear Programs.	The Sharpest Cut	2004	DBLP DOI BibTeX RDF
40	Denis Naddef	The Domino Inequalities for the Symmetric Traveling Salesman Problem.	The Sharpest Cut	2004	DBLP DOI BibTeX RDF
40	Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli	Bicolorings and Equitable Bicolorings of Matrices.	The Sharpest Cut	2004	DBLP DOI BibTeX RDF
40	Jean Fonlupt	The Clique-Rank of 3-Chromatic Perfect Graphs.	The Sharpest Cut	2004	DBLP DOI BibTeX RDF
40	Laurence A. Wolsey	Time for Old and New Faces.	The Sharpest Cut	2004	DBLP DOI BibTeX RDF
40	Robert E. Bixby, Mary Fenelon, Zonghao Gu, Edward Rothberg, Roland Wunderling	Mixed-Integer Programming: A Progress Report.	The Sharpest Cut	2004	DBLP DOI BibTeX RDF
40	Claudio Gentile, Utz-Uwe Haus, Matthias Köppe, Giovanni Rinaldi, Robert Weismantel	On the Way to Perfection: Primal Operations for Stable Sets in Graphs.	The Sharpest Cut	2004	DBLP DOI BibTeX RDF
40	Ralf Borndörfer	Combinatorial Packing Problems.	The Sharpest Cut	2004	DBLP DOI BibTeX RDF
40	Martin Grötschel	Cardinality Homogeneous Set Systems, Cycles in Matroids, and Associated Polytopes.	The Sharpest Cut	2004	DBLP DOI BibTeX RDF
40	Petra Mutzel, Michael Jünger	Graph Drawing: Exact Optimization Helps!	The Sharpest Cut	2004	DBLP DOI BibTeX RDF
40	Annegret Katrin Wagler	Relaxing Perfectness: Which Graphs Are "Almost" Perfect?	The Sharpest Cut	2004	DBLP DOI BibTeX RDF
40	Volker Kaibel	On the Expansion of Graphs of 0/1-Polytopes.	The Sharpest Cut	2004	DBLP DOI BibTeX RDF
40	Christoph Helmberg	A Cutting Plane Algorithm for Large Scale Semidefinite Relaxations.	The Sharpest Cut	2004	DBLP DOI BibTeX RDF
40	Marcus Oswald, Gerhard Reinelt	Computing Optimal Consecutive Ones Matrices.	The Sharpest Cut	2004	DBLP DOI BibTeX RDF
40	Vijay Chandru, M. Rammohan Rao, Ganesh Swaminathan	Protein Folding on Lattices: An Integer Programming Approach.	The Sharpest Cut	2004	DBLP DOI BibTeX RDF
39	Ye Hou, Bao-Long Guo, Jeng-Shyang Pan 0001	The Application and Study of Graph Cut in Motion Segmentation.	IAS	2009	DBLP DOI BibTeX RDF
39	Marcelo Finger, Dov M. Gabbay	Cut and Pay.	J. Log. Lang. Inf.	2006	DBLP DOI BibTeX RDF
39	Agata Ciabattoni, Kazushige Terui	Modular Cut-Elimination: Finding Proofs or Counterexamples.	LPAR	2006	DBLP DOI BibTeX RDF
39	Grigori Mints	Unwinding a Non-effective Cut Elimination Proof.	CSR	2006	DBLP DOI BibTeX RDF
39	Roee Engelberg, Jochen Könemann, Stefano Leonardi 0001, Joseph Naor	Cut Problems in Graphs with a Budget Constraint.	LATIN	2006	DBLP DOI BibTeX RDF
39	Irith Pomeranz, Sudhakar M. Reddy	The Cut Delay Fault Model for Guiding the Generation of n-Detection Test Sets for Transition Faults.	VLSI Design	2006	DBLP DOI BibTeX RDF
39	Reuven Y. Rubinstein	Cross-entropy and rare events for maximal cut and partition problems.	ACM Trans. Model. Comput. Simul.	2002	DBLP DOI BibTeX RDF	Combinatorial optimization, importance sampling, cross-entropy, rare event simulation
39	Sanjiv Kapoor	On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees.	IPCO	1996	DBLP DOI BibTeX RDF
39	Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis	All-Pairs Min-Cut in Sparse Networks.	FSTTCS	1995	DBLP DOI BibTeX RDF
39	Halimin Herjanto, Muslim Amin, Cut Erika Fatimah	Does knowledge collecting and donating enhance a bank's salesperson performance?	Bus. Process. Manag. J.	2024	DBLP DOI BibTeX RDF
39	Cut Alna Fadhilla, Muhammad Dany Alfikri, Rafael Kaliski	Lightweight Meta-Learning BotNet Attack Detection.	IEEE Internet Things J.	2023	DBLP DOI BibTeX RDF
39	Zamzami Zainuddin, Ratna Farida, Cut Muftia Keumala, Rudi Kurniawan, Hadi Iskandar	Synchronous online flip learning with formative gamification quiz: instruction during COVID-19.	Interact. Technol. Smart Educ.	2022	DBLP DOI BibTeX RDF
39	Kharis Kharis, Cut Nyak Dameria, Martin Ebner	Perception and Acceptance of Padlet as a Microblogging Platform for Writing Skills.	Int. J. Interact. Mob. Technol.	2020	DBLP DOI BibTeX RDF
39	Zamzami Zainuddin, Yin Zhang, Xiuhan Li, Samuel Kai-Wah Chu, Saifullah Idris, Cut Muftia Keumala	Research trends in flipped classroom empirical evidence from 2017 to 2018.	Interact. Technol. Smart Educ.	2019	DBLP DOI BibTeX RDF
39	Cut Maisyarah Karyati, Aries Muslim, Daryl Diningrat	3D Saliva Ferning Images to Determine The Women's Fertility Rates.	ICVIP	2019	DBLP DOI BibTeX RDF
39	Amin Subandi, Rini Meiyanti, Cut Lika Mestika Sandy, Rahmat Widia Sembiring	Three-Pass Protocol Implementation in Vigenere Cipher Classic Cryptography Algorithm with Keystream Generator Modification.	CoRR	2017	DBLP BibTeX RDF
39	Chenghao Li 0004, Yuan Zhou 0006, Bo Cut, Chunping Hou	Depth-weighted correlation method for visual tracking with occlusion detection.	ICIP	2017	DBLP DOI BibTeX RDF
39	Aries Muslim, A. B. Mutiara 0001, Cut Maisyarah Karyati, Purnawarman Musa	An Algorithm for Index Multimedia Data (Video) using the Movement Oriented Method for Real-time Online Services	CoRR	2010	DBLP BibTeX RDF
38	Jue Wang 0001, Pravin Bhat, Alex Colburn, Maneesh Agrawala, Michael F. Cohen	Interactive video cutout.	ACM Trans. Graph.	2005	DBLP DOI BibTeX RDF	alpha matting, interactive video processing, mean-shift segmentation, graph-cut, min-cut
38	Jin-Tai Yan	Connection-oriented net model and fuzzy clustering techniques for K-way circuit partitioning.	ICCD	1995	DBLP DOI BibTeX RDF	fuzzy neural nets, connection-oriented net model, fuzzy clustering techniques, K-way circuit partitioning, chain net model, cut analysis, multiple-pin net, edge-weighted graph, MCNC circuit benchmarks, partitioning balance, partitioning cut, computational complexity, complexity, fuzzy logic, high level synthesis, circuit analysis computing, hypergraph, fuzzy c-means clustering, mapped graph, fuzzy memberships
37	Hongwei Liu 0001, Sanyang Liu, Fengmin Xu	A Tight Semidefinite Relaxation of the MAX CUT Problem.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	semidefinite relaxation, cut polytope, metric polytope, MAX CUT problem