Hiromu Ariyoshi

A New Algorithm for Generating All the Maximal Independent Sets

The problem of generating all the maximal independent sets (or maximal cliques) of a given graph is fundamental in graph theory and is also one of the most important in terms of the application of graph theory. In this paper, we present a new efficient algorithm for generating all the maximal independent sets, for which processing time and memory space are bounded by

Area-efficient drawings of rectangular duals for VLSI floor-plan

O(nm\mu)

Architecture for MPEG2 MP@HL real time motion estimator

and

Analysis of Stability Control of a Power System with a Distributed Constant Circuit Model

O(n+m)

VLSI implementation of hierarchical motion estimator for MPEG2 MP@HL

, respectively, where n, m, and

An efficient heuristic approach to state encoding for PLA-based sequential circuits

\mu

An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset

are the numbers of vertices, edges, and maximal independent sets of a graph.

Fast Solutions for Consecutive 2-out-of-r-from-n : F System

AbstractIn this paper, we consider a problem to seek a rectangular dual

A new algo-rithm for generating all maximal independent sets

\tilde D