Analysis of a distributed scheduler for communication networks

This publication has 8 references indexed in Scilit:

• Decomposition of perfect graphs
  Journal of Combinatorial Theory, Series B, 1987
• An Algorithmic Theory of Numbers, Graphs and Convexity
  Published by Society for Industrial & Applied Mathematics (SIAM) ,1986
• Complexity of network synchronization
  Journal of the ACM, 1985
• On the np-completeness of certain network testing problems
  Networks, 1984
• A Composition for Perfect Graphs
  Published by Elsevier ,1984
• The NP-completeness column: An ongoing guide
  Journal of Algorithms, 1982
• The ellipsoid method and its consequences in combinatorial optimization
  Combinatorica, 1981
• Multicolorings, measures and games on graphs
  Discrete Mathematics, 1976