Observability and reachability of grid graphs via reduction and symmetries.
Giuseppe NotarstefanoGianfranco ParlangeliPublished in: CDC/ECC (2011)
Keyphrases
- state space
- partially observable
- computational grids
- graph matching
- spanning tree
- random graphs
- directed graph
- subgraph isomorphism
- graph representation
- complex structures
- graph databases
- graph model
- grid services
- graph theoretic
- grid computing
- bipartite graph
- data sets
- grid structure
- partial observability
- series parallel
- reduction method
- graph structure
- graph theory
- decision problems
- rough sets
- decision making