The Kleitman-Wang algorithms refer to a class of algorithms used primarily in combinatorial optimization and graph theory. These algorithms are particularly known for their application in finding maximum independent sets in certain types of graphs. The most notable contribution by David Kleitman and Fan R. Wang was the development of an efficient algorithm to find large independent sets in specific kinds of graphs, particularly bipartite graphs or specific sparse graphs. Their work often explores the relationships between graph structures and combinatorial properties.
Articles by others on the same topic
There are currently no matching articles.