Consistency of P-time event graphs is decidable in polynomial time (extended version).
Davide ZorzenonJörg RaischPublished in: CoRR (2023)
Keyphrases
- graph isomorphism
- special case
- monadic second order logic
- event detection
- bounded treewidth
- graph matching
- computational complexity
- first order logic
- planar graphs
- graph representation
- knowledge base
- polynomial time complexity
- polynomial hierarchy
- graph theory
- database systems
- graph partitioning
- subgraph isomorphism
- constraint networks
- graph model
- expressive power
- learning algorithm