Bounding the monomial index and (1, l)-weight choosability of a graph.
Ben SeamonePublished in: Discret. Math. Theor. Comput. Sci. (2014)
Keyphrases
- directed graph
- graph structure
- edge weights
- random walk
- bipartite graph
- graph theory
- graph representation
- index structure
- connected components
- weighted graph
- graph databases
- stable set
- data sets
- random graphs
- structural similarity
- database systems
- graph partitioning
- directed acyclic graph
- graph matching
- graph search
- databases