Search

Your search keyword '"Heggernes, Pinar"' showing total 4 results
Start Over Author "Heggernes, Pinar" Journal electronic notes in discrete mathematics
4 results on '"Heggernes, Pinar"'

1. Recognizability equals definability for graphs of bounded treewidth and bounded chordality

Author

Bodlaender, Hans L., Heggernes, Pinar, Telle, Jan Arne, Sub Algorithms and Complexity, Algorithmic Systems, Sub Algorithms and Complexity, Algorithmic Systems, and Algorithms, Geometry and Applications

Subjects
Discrete mathematics, Logic, Applied Mathematics, Treewidth, Chordality, Definability, Automata, Automaton, Combinatorics, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Computer Science::Discrete Mathematics, Computer Science::Logic in Computer Science, Bounded function, Discrete Mathematics and Combinatorics, Recognizability, Computer Science::Data Structures and Algorithms, Computer Science::Formal Languages and Automata Theory, MathematicsofComputing_DISCRETEMATHEMATICS, Mathematics
Abstract

We prove that every recognizable family of graphs of bounded treewidth and bounded chordality is definable in counting monadic second-order logic.

Published
2015

Catalog

Books, media, physical & digital resources
See catalog results