A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Perhaps the oldest algorithmic technique used for the Graph Isomorphism prob-lem is the Weisfeiler-Lehman procedure. Invented in the late 1960's, it has attracted research in several directions over the last five decades, and continues to be an actively researched topic. Algorithmists invariably use this procedure in combination with others tools for Graph Isomorphism. Logicians interested in descriptive complexity have found logical characterizations for it. There is a linear programmingdblp:journals/eatcs/Arvind16 fatcat:rfsfihoq6rbjll7qht5rzlkopy