Polynomial Algorithms for Perfect Graphs

This publication has 8 references indexed in Scilit:

• Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs
  Discrete Mathematics, 1981
• The ellipsoid method and its consequences in combinatorial optimization
  Combinatorica, 1981
• Khachiyan’s algorithm for linear programming
  Published by Springer Nature ,1981
• On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
  IEEE Transactions on Information Theory, 1979
• On the Shannon capacity of a graph
  IEEE Transactions on Information Theory, 1979
• Almost integral polyhedra related to certain combinatorial optimization problems
  Linear Algebra and its Applications, 1976
• Normal hypergraphs and the perfect graph conjecture
  Discrete Mathematics, 1972
• The zero error capacity of a noisy channel
  IEEE Transactions on Information Theory, 1956