検索結果 1 件

デジタル記事
2003-12Bulletin of informatics and cybernetics35 1/2p.57-67
インターネットで読める全国の図書館
  • 目次・記事shortest_path_rewriting.pdf p057.pdf
  • 要約等We consider a graph with labels of...... A label means the length of an edge. We......hod to compute the length of the shortest path between two vertices using graph transformations. We introduce graph transformation rules which preserve the length of paths. Reducing to a simple graph which contains......ally calculate the length of the shortest path of those two vertices. There were several algorithms for computing netw......bilities using graph transformations. We use the same framework......ose algorithms for applying the graph transformation rules, but our transformation rules do not calculate the network reliabilities but cal...
  • 関連情報Bulletin of informatics and cybernetics || 35(1/2) || p57...

検索結果は以上です。