全部 |
  • 全部
  • 题名
  • 作者
  • 机构
  • 关键词
  • NSTL主题词
  • 摘要
检索 二次检索 AI检索
外文文献 中文文献
筛选条件:

1. Approximable 1-Turn Routing Problems in All-Optical Mesh Networks NSTL国家科技图书文献中心

Guillaume Bagan |  Olivier Cogis... -  《Algorithmic operations research》 - 2009,4(2) - 95~101 - 共7页

摘要:In all-optical networks, several communications can be transmitted through the same fiber link provided that they usedifferent wavelengths. The MINIMUM ALL-OPTICAL ROUTING problem (given a list of pai...
关键词: minimum load routing |  minimum path colouring |  all-optical networks |  mesh |  1-turn routing |  approximationalgorithms

2. Generating All the Minimal Separators of a Graph NSTL国家科技图书文献中心

Anne Berry |  Jean-Paul Bordat... -  《Graph-Theoretic Concepts in Computer Science》 -  Graph-Theoretic Concepts in Computer Science - 1999, - 167~178 - 共12页

摘要:We present an efficient algorithm which computes the set of minimal separators of a graph in O(n~3) time per separator, thus gaining a factor of n~2 on the current best-time algorithms for this proble...
关键词: Graph. Minimal Separator. Enumeration Algorithm.

3. The mv-decomposition: definition and application to the distance-2 broadcast problem in multi-hops radio networks NSTL国家科技图书文献中心

Olivier Cogis |  Benoit Darties... -  《Fifth IFIP International Conference on Theoretical Computer Science - TCS 2008 :》 -  Fifth IFIP International Conference on Theoretical Computer Science - TCS 2008 : - 2008, - 115~126 - 共12页

摘要:We present a new tool called the ”mv- decomposition”, and we describe some interesting algorithmic properties about it. We propose an algorithm with a complexity of

4. The mv-decomposition: definition and application to the distance-2 broadcast problem in multi-hops radio networks NSTL国家科技图书文献中心

Olivier Cogis |  Benott Darties... -  《Fifth IFIP International Conference on Theoretical Computer Science - TCS 2008 :》 -  Fifth IFIP International Conference on Theoretical Computer Science - TCS 2008 : - 2008, - 115,126~ - 共2页

摘要:We present a new tool called the "mv-decomposition", and we describe some interesting algorithmic properties about it. We propose an algorithm with a complexity of O(m) to build a mv-decomposition for...

5. On the List Colouring Problem NSTL国家科技图书文献中心

Olivier Cogis |  Jean-Claude Konig... -  《7th Asian Computing Science Conference (ASIAN 2002)》 -  7th Asian Computing Science Conference (ASIAN 2002) - 2002, - 47~56 - 共10页

摘要:To colour a graph G from lists (L_v)_(v∈V(G)) is to assign to each vertex v of G one of the colours from its list L_v so that no two adjacent vertices in G are assigned the same colour. The problem, w...
检索条件作者:Olivier Cogis
  • 检索词扩展

NSTL主题词

  • NSTL学科导航