Matroid algorithm for monitorability analysis of bond graphs.
Hafid HaffafBelkacem Ould BouamamaGeneviève Dauphin-TanguyPublished in: J. Frankl. Inst. (2006)
Keyphrases
- learning algorithm
- dynamic programming
- cost function
- high accuracy
- experimental evaluation
- improved algorithm
- preprocessing
- search space
- recognition algorithm
- graph structure
- optimal solution
- computational cost
- segmentation algorithm
- matching algorithm
- similarity measure
- tree structure
- energy function
- optimization algorithm
- theoretical analysis
- np hard
- significant improvement
- k means
- clustering method
- input data
- times faster
- combinatorial optimization
- computational complexity
- objective function
- undirected graph
- graph clustering
- graph construction
- finding the shortest path