CFI Construction and Balanced Graphs

Authors:
Xiang Zhou
Affiliations:
State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, and School of Information Science and Engineering, Graduate University of Chinese Academy of Sciences,
Venue:
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Year:
2009

Citing 10
Cited 0

Graph searching and a min-max theorem for tree-width

Journal of Combinatorial Theory Series B
Logical hierarchies in PTIME

Information and Computation
Graph classes: a survey

Graph classes: a survey
Isomorphism testing for embeddable graphs through definability

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Definability and Descriptive Complexity on Databases of Bounded Tree-Width

ICDT '99 Proceedings of the 7th International Conference on Database Theory
Fixed-Point Logics on Planar Graphs

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs

Discrete Applied Mathematics
Definable Tree Decompositions

LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
The Power of Counting Logics on Restricted Classes of Finite Structures

CSL '07/EACSL '07, Proceedings of the 21st international workshop and the 16th Annual Conference of the EACSL on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article, we define a new variant of Cai-Fürer-Immerman construction. With this construction and some conditions of Dawar and Richerby, we are able to show that inflationary fixed point logic with counting (IFP+C) does not capture PTIME on the class of balanced graphs.