An improved error term for minimum H-decompositions of graphs.
Peter AllenJulia BöttcherYury PersonPublished in: J. Comb. Theory, Ser. B (2014)
Keyphrases
- error rate
- graph model
- spanning tree
- bipartite graph
- series parallel
- error bounds
- graph matching
- connected dominating set
- square error
- graph mining
- minimum cost
- threshold values
- graph construction
- global minimum
- graph theoretic
- graph partitioning
- lower bound
- directed graph
- singular value decomposition
- relational databases