By Topic

Enumerating the min-cuts for applications to graph extraction under size constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Azegami, K.R. ; Dept. of Electr. & Electron. Eng., Tokyo Inst. of Technol., Japan ; Takahashi, A. ; Kajitan, Y.

Given an undirected hypergraph G0 with two vertices s and t specified, our problem is to extract a maximal subgraph under a constraint. It comprises two terms, the upper bound of the area and the cut separating the subgraph being an s-t minimum cut. If G0 is a model of a logic circuit, this is a faithful problem formulation in implementation of PPGA or MCM. Aiming to support such a design, we propose a representation of the s-t minimum cut of G0 in terms of a directed acyclic graph G*. The key idea is to transform G0 to a directed flow-graph with source s and sink t by a known technique and, after finding a maximum flow, to traverse the graph by a forward-search, which we introduce here

Published in:

Circuits and Systems, 1999. ISCAS '99. Proceedings of the 1999 IEEE International Symposium on  (Volume:6 )

Date of Conference:

Jul 1999