@inbook{ImmermanLander:1990,
    Abstract = {In this paper we ask the question, ``What must be added to first-order logic plus least-fixed point to obtain exactly the polynomial-time properties of unordered graphs?'' We consider the languages Lkconsisting of first-order logic restricted to k variables and Ckconsisting of Lkplus ``counting quantifiers''. We give efficient canonization algorithms for graphs characterized by Ckor Lk. It follows from known results that all trees and almost all graphs are characterized by C2.},
    Address = {New York, NY},
    Author = {Immerman, Neil and Lander, Eric},
    BookTitle = {Complexity Theory Retrospective: In Honor of Juris Hartmanis on the Occasion of His Sixtieth Birthday, July 5, 1988},
    Editor = {Selman, Alan L.},
    File = {Describing Graphs- A First-Order Approach to Graph Canonization - Immerman-Lander1990\_Chapter\_DescribingGraphsAFirst-OrderAp - a - a - u.pdf},
    ISBN = {978-1-4612-4478-3},
    Pages = {59--81},
    Publisher = {Springer New York},
    Title = {Describing Graphs: A First-Order Approach to Graph Canonization},
    URL = {https://doi.org/10.1007/978-1-4612-4478-3\_5},
    Year = {1990},
    bdsk-url-1 = {https://doi.org/10.1007/978-1-4612-4478-3\_5},
    date-added = {2019-11-04 15:14:02 +0100},
    date-modified = {2019-11-04 15:16:39 +0100},
    doi = {10.1007/978-1-4612-4478-3_5}
}

@inbook{ImmermanLander:1990, Abstract = {In this paper we ask the question, What must be added to first-order logic plus least-fixed point to obtain exactly the polynomial-time properties of unordered graphs?'' We consider the languages Lkconsisting of first-order logic restricted to k variables and Ckconsisting of Lkpluscounting quantifiers''. We give efficient canonization algorithms for graphs characterized by Ckor Lk. It follows from known results that all trees and almost all graphs are characterized by C2.}, Address = {New York, NY}, Author = {Immerman, Neil and Lander, Eric}, BookTitle = {Complexity Theory Retrospective: In Honor of Juris Hartmanis on the Occasion of His Sixtieth Birthday, July 5, 1988}, Editor = {Selman, Alan L.}, File = {Describing Graphs- A First-Order Approach to Graph Canonization - Immerman-Lander1990_Chapter_DescribingGraphsAFirst-OrderAp - a - a - u.pdf}, ISBN = {978-1-4612-4478-3}, Pages = {59--81}, Publisher = {Springer New York}, Title = {Describing Graphs: A First-Order Approach to Graph Canonization}, URL = {https://doi.org/10.1007/978-1-4612-4478-3_5}, Year = {1990}, bdsk-url-1 = {https://doi.org/10.1007/978-1-4612-4478-3_5}, date-added = {2019-11-04 15:14:02 +0100}, date-modified = {2019-11-04 15:16:39 +0100}, doi = {10.1007/978-1-4612-4478-3_5} }