New bounds on domination and independence in graphs.
Jochen HarantSamuel MohrPublished in: Discuss. Math. Graph Theory (2023)
Keyphrases
- upper bound
- graph matching
- lower bound
- conditional independence
- graph theoretic
- upper and lower bounds
- data sets
- bayesian networks
- worst case
- database
- graph theory
- structured objects
- tight bounds
- independence assumption
- random graphs
- lower and upper bounds
- graph partitioning
- graph databases
- graph structure
- error bounds
- directed graph
- graphical models