Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
Attributed to:
Descriptive Complexity with Algebraic Operators
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-319-13524-3_12
Publication URI: http://dx.doi.org/10.1007/978-3-319-13524-3_12
Type: Book Chapter
Book Title: Parameterized and Exact Computation (2014)
Page Reference: 135-146
ISBN: 978-3-319-13523-6