Upper bound on the sum of powers of the degrees of graphs with few crossings per edge.
Xin ZhangPublished in: Appl. Math. Comput. (2019)
Keyphrases
- upper bound
- weighted graph
- lower bound
- undirected graph
- edge detection
- graph theoretic
- worst case
- branch and bound
- linear functions
- branch and bound algorithm
- lower and upper bounds
- minimum spanning trees
- adjacency graph
- graph theory
- edge information
- graph representation
- edge weights
- directed graph
- graph structure
- edge map
- subgraph isomorphism
- strongly connected
- edge detector
- graph model
- graph databases
- complex structures
- graph matching
- series parallel
- shortest path