On the Wimer Method for Designing Edge-Based Algorithms
Alan C. Jamieson, Wayne Goddard, Stephen T. Hedetniemi, Teresa W. Haynes · AKCE International Journal of Graphs and Combinatorics · 2008
The construction of “Wimer”-style table-based algorithms for edge parameters in graphs is discussed. While algorithms for many parameters on graphs classes such as bounded treewidth are commonplace, there are some potential advantages to the table approach, such as automated construction and information gathering.