検索結果 3 件
記事
全国の図書館
- 要約等We define a new framework for rewriting graphs, called a formal graph system (FGS), ......am having hypergraphs instead of te......hat a class of graphs is generated ......grammar if and only if it is def......S of a special form called a regu......e can define a refutation tree for an FGS. The classes of TTSP graphs and outerplanar graphs are definable......GSs. Then, we consider the problem of constructing a refutation tree of a graph for these FGSs. For the FGS defining TTSP graphs, we present a refutation tree algorithm of O...... m) Processors on an EREW PRAM. For the FGS defining outerplanar graphs, we show that the refutation...
- 件名algorithm and computational complexity formal graph system refutation tree two-terminal series parallel graph outerplanar graph
デジタル文書・図像類
インターネットで読める全国の図書館
- 一般注記Revised: April, 1993, To appear in IEICE Transactions on Information and Systems
- 関連情報RIFIS Technical Report || 59 || p1-22 http://www.i.kyushu-u.a...
検索結果は以上です。