Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Interval Graph Problems on Reconfigurable Meshes S. Olariu and J. L. Schwing Department of Computer Science Old Dominion University Norfolk, VA 23529-0162 and J. Zhang Department of Mathematics and Computer Science Elizabeth City State University Elizabeth City, NC 27909 Work supported by the National Science Foundation under grant CCR-8909996 and by NASA under grant NCC1-99; Abstract A graph G is an interval graph if there is a one-one correspondence beten its vertices and a family I of intervals, such that two vertices in G are adjacent if and only if their corresponding intervals overlap. In this context, the family I of intervals is referred to as an interval model of G. Recently, a porful architecture called the reconfigurable mesh has been proposed: in essence, a reconfigurable mesh consists of a mesh-connected architecture augmented by a dynamically reconfigurable bus system. ,  exploit the reconfigurable mesh architecture for the purpose of obtaining constant-time algorithms for a number of computational problems on interval graphs. These problems include finding a maximum size clique, a maximum ight clique in the presence of integer ights, a maximum size independent set, a minimum clique cover, a minimum size dominating set, a shortest path beten any two vertices in G, the diameter and the center of G, as ll as Breadth-First Search and Depth-First Search trees for G. Specifically, with an n-vertex interval graph specified by its interval model as input, all our algorithms run in constant time on a reconfigurable mesh of size n x n.
['Stephan Olariu', 'James L. Schwing', 'Jingyuan Zhang']
I am writing a research paper on a idea Interval Graph Problems on Reconfigurable Meshes
[{"from": "human", "value": "I am writing a research paper on a idea Interval Graph Problems on Reconfigurable Meshes"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Interval Graph Problems on Reconfigurable Meshes S. Olariu and J. L. Schwing Department of Computer Science Old Dominion University Norfolk, VA 23529-0162 and J. Zhang Department of Mathematics and Computer Science Elizabeth City State University Elizabeth City, NC 27909 Work supported by the National Science Foundation under grant CCR-8909996 and by NASA under grant NCC1-99; Abstract A graph G is an interval graph if there is a one-one correspondence beten its vertices and a family I of intervals, such that two vertices in G are adjacent if and only if their corresponding intervals overlap. In this context, the family I of intervals is referred to as an interval model of G. Recently, a porful architecture called the reconfigurable mesh has been proposed: in essence, a reconfigurable mesh consists of a mesh-connected architecture augmented by a dynamically reconfigurable bus system. ,  exploit the reconfigurable mesh architecture for the purpose of obtaining constant-time algorithms for a number of computational problems on interval graphs. These problems include finding a maximum size clique, a maximum ight clique in the presence of integer ights, a maximum size independent set, a minimum clique cover, a minimum size dominating set, a shortest path beten any two vertices in G, the diameter and the center of G, as ll as Breadth-First Search and Depth-First Search trees for G. Specifically, with an n-vertex interval graph specified by its interval model as input, all our algorithms run in constant time on a reconfigurable mesh of size n x n."}]