Lower bounds on the signed domination numbers of directed graphs.
Hossein KaramiSeyed Mahmoud SheikholeslamiAbdollah KhodkarPublished in: Discret. Math. (2009)
Keyphrases
- directed graph
- lower bound
- upper bound
- random walk
- branch and bound algorithm
- lower and upper bounds
- graph structure
- directed acyclic graph
- strongly connected
- maximum flow
- objective function
- branch and bound
- vc dimension
- upper and lower bounds
- set of randomly generated instances
- optimal cost
- lower bounding
- quadratic assignment problem
- web graph
- np hard
- worst case
- disjoint paths