Upper bounds for bar visibility of subgraphs and n-vertex graphs.
Yuanrui FengDouglas B. WestYan YangPublished in: Discret. Appl. Math. (2020)
Keyphrases
- upper bound
- labeled graphs
- connected subgraphs
- lower bound
- graph mining
- graph databases
- directed graph
- graph properties
- biological networks
- upper and lower bounds
- graph structures
- subgraph isomorphism
- frequent subgraphs
- subgraph matching
- lower and upper bounds
- undirected graph
- directed acyclic graph
- attributed graphs
- graph kernels
- maximum clique
- frequent subgraph mining
- tight bounds
- branch and bound algorithm
- reachability queries
- subgraph mining
- graph patterns
- graph data
- graph theoretic
- similarity function
- vertex set
- worst case
- graph matching
- maximum common subgraph
- connected components
- hamiltonian cycle
- graph structure
- regular expressions
- average degree
- data structure
- dense subgraphs
- pattern mining
- topological information
- dynamic graph
- sample complexity
- maximum cardinality
- tight upper and lower bounds