An upper bound for maximum number of edges in a strongly multiplicative graph.
Chandrashekar AdigaMahadev SmithaPublished in: Discuss. Math. Graph Theory (2006)
Keyphrases
- maximum number
- upper bound
- directed graph
- weighted graph
- lower bound
- spanning tree
- undirected graph
- edge weights
- directed acyclic graph
- worst case
- graph model
- graph representation
- stable set
- branch and bound
- lower and upper bounds
- massive graphs
- graph structure
- vertex set
- graph theory
- connected components
- random walk
- branch and bound algorithm
- real world graphs
- directed edges
- graph partitioning
- structured data
- spectral embedding
- maximum matching
- bipartite graph
- shortest path
- graph clustering
- image processing
- error probability