An Improved Two-way Partitioning Algorithm with Stable Performance

No abstract is available for this paper.

• Publication year

  1990

• Venue

  Computer-aided Design

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Towards efficient hierarchical designs by ratio cut partitioning

  1989cited by this paper
• An Evolution-Based Approach to Partitioning ASIC Systems

  1989cited by this paper
• Partitioning by Probability Condensation

  1989cited by this paper
• An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms

  1988cited by this paper
• An improved objective function for mincut circuit partitioning

  1988cited by this paper
• On the partitioning of graphs and hypergraphs

  1987cited by this paper
• An Improved Min-Cut Algonthm for Partitioning VLSI Networks

  1984cited by this paper
• A proper model for the partitioning of electrical circuits

  1972cited by this paper
• An efficient heuristic procedure for partitioning graphs

  1970cited by this paper

• Optimization of Vlsi Physical Design Bisectional Placement with Quantum Approximation Algorithm

  2025cites this paper
• Non-negative and sparse spectral clustering

  2014cites this paper
• Wireless sensor network aided search and rescue in trails

  2007cites this paper
• The Islands Approach to Nearest Neighbor Querying in Spatial Networks

  2005cites this paper
• Hierarchical Clustering Algorithms for Document Datasets

  2005cites this paper
• Empirical and Theoretical Comparisons of Selected Criterion Functions for Document Clustering

  2004cites this paper
• Multiset graph partitioning

  2002cites this paper
• A min-max cut algorithm for graph partitioning and data clustering

  2001cites this paper
• A spectral method to separate disconnected and nearly-disconnected web graph components

  2001cites this paper
• Hypergraph Based Declustering for Multi-disk Databases Abstract Hypergraph Based Declustering for Multi-disk Databases

  2000cites this paper
• Optimizing path query performance: graph clustering strategies ☆

  2000influential citation
• CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations

  1997influential citation
• Partitioning around roadblocks: tackling constraints with intermediate relaxations

  1997cites this paper
• Parallel Multilevel k-way Partitioning Scheme for Irregular Graphs

  1996cites this paper
• VLSI circuit partitioning by cluster-removal using iterative improvement techniques

  1996cites this paper
• High-Performance Bit-Serial Datapath Implementation for Large-Scale Configurable Systems

  1996influential citation
• Multilevel Graph Partitioning Schemes

  1995influential citation
• CCAM: a connectivity-clustered access method for aggregate queries on transportation networks: a summary of results

  1995influential citation
• Circuit Partitioning for Huge Logic Emulation Systems

  1994influential citation
• A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs

  1994cites this paper
• International Journal of Computing and Digital Systems Networks-on-chip Architecture Customization Using Network Partitioning: a System-level Performance Evaluation

  year unknowncites this paper
• Reprints Available Directly from the Publisher Photocopying Permitted by License Only (c) 2000 Opa (overseas Publishers Association) N.v. Fpga Partitioning with Complex Resource Constraints*

  year unknowncites this paper