ENISLE: A clustering algorithm for nearly maximal and minimal connection on hypergraph

Kou Hsing Cheng, Shun Wen Cheng

Research output: Contribution to journalArticlepeer-review


This work presents two approaches with a high probability of obtaining maximal and minimal connection in an electrical network. The first method, referred to herein as Edge-Node Interleaved Sort for Leaching and Envelop (ENISLE) algorithm, uses both node information and edge information and works effectively on a common network. The second method, referred to herein as Interleaved Cutting-ENISLE (IC-ENISLE) algorithm, uses node and edge information as well as the max-min dual property. This method works better than ENISLE in an electrical circuit. This study also finds the relationship between minimal connection and the initial node-edge pairs distributed condition/ entropy on hypergraph circuit. Under a nearly max-connection reservation, a circuit with a high initial potential/entropy implies a high probability of aiming the minimal connection. From our approach, the work indicates that the minimum connection plane characteristics significantly affect the connection problems. Our results further demonstrate that, with respect to the sequential circuit or other time-sensitive circuits as an indivisible element, record the level is even or odd, and/or record the level number of every node or edge, are highly effective for modem circuit network connection.

Original languageEnglish
Pages (from-to)155-164
Number of pages10
JournalTamkang Journal of Science and Engineering
Issue number2
StatePublished - Jun 2005


  • Clustering Effect
  • Hypergraph
  • Minimal-connection
  • Quasi-random
  • Radix Sort
  • VLSI Circuit


Dive into the research topics of 'ENISLE: A clustering algorithm for nearly maximal and minimal connection on hypergraph'. Together they form a unique fingerprint.

Cite this