| Presentation | 1994/11/17 Maximally-Distant Common-Tree Pairs and Their Applications to Interval Analysis of Active Circuits Takao Ozawa, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | A maximally-distant common-tree pair of 2-graphs (current graph and voltage graph from an active circuit) is defined to be a common-tree pair of the 2-graphs such that the number of edges which the pair have in common is minimum. It is an extension of the well-known maximally-distant tree pair of a single graph defined in relation to the principal partition of a graph. Different from the maximally-distant tree of a single graph, no polynomial-order algorithm for obtaining such a pair is known. Apparently, any such algorithm has to deal with the total of 4 trees in different 2 graphs, which will make the algorithm very complex. We note that 2-graphs derived from an active circuit usually contain parallel or series edge pairs, and based on this fact, we construct a simple heuristic algorithm. The algorithm searches for a parallel or series edge pair in the 2-graphs and assigns each edge of such an edge pair to each common-tree of the common-tree pair. If no parallel or series edge pair is found, the algorithm chooses an edge and splits it in order to create a parallel or series edge pair. The results of the interval analysis of active circuits using the common-tree pairs obtained by the algorithm are presented. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | 2-graph method / graph algorithm / common-tree pair / active circuit analysis / interval analysis |
| Paper # | CAS94-61,CST94-21 |
| Date of Issue |
| Conference Information | |
| Committee | CST |
|---|---|
| Conference Date | 1994/11/17(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Concurrent System Technology (CST) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Maximally-Distant Common-Tree Pairs and Their Applications to Interval Analysis of Active Circuits |
| Sub Title (in English) | |
| Keyword(1) | 2-graph method |
| Keyword(2) | graph algorithm |
| Keyword(3) | common-tree pair |
| Keyword(4) | active circuit analysis |
| Keyword(5) | interval analysis |
| 1st Author's Name | Takao Ozawa |
| 1st Author's Affiliation | Department of Applied Mathematics and Informatics Faculty of Science and Engineering, Ryukoku University() |
| Date | 1994/11/17 |
| Paper # | CAS94-61,CST94-21 |
| Volume (vol) | vol.94 |
| Number (no) | 333 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |