On the decomposition of a minimally strongly h-connected digraph into h+1 acircuitic sub-graphs.
Yahya Ould HamidounePublished in: Discret. Math. (1980)
Keyphrases
- series parallel
- structural learning
- connected graphs
- tree decomposition
- graph theory
- neighborhood graph
- case study
- graph matching
- graph structure
- graph mining
- connected components
- database
- strongly connected components
- directed graph
- hierarchical decomposition
- image decomposition
- decomposition methods
- random graphs
- decomposition method
- graph theoretic
- graph partitioning
- undirected graph
- graph databases
- graph model