On some graph densities in locally dense graphs.
Joonkyung LeePublished in: Random Struct. Algorithms (2021)
Keyphrases
- quasi cliques
- graph representation
- graph theory
- directed graph
- graph matching
- graph databases
- graph construction
- graph structure
- weighted graph
- adjacency matrix
- densely connected
- labeled graphs
- graph model
- graph theoretic
- graph mining
- graph data
- graph structures
- graph clustering
- graph classification
- graph properties
- graph theoretical
- undirected graph
- graph partitioning
- random graphs
- bipartite graph
- series parallel
- spanning tree
- reachability queries
- graph search
- graph transformation
- subgraph isomorphism
- dynamic graph
- minimum spanning tree
- connected graphs
- graph layout
- inexact graph matching
- graph kernels
- dense subgraphs
- graph drawing
- neighborhood graph
- structural pattern recognition
- graph representations
- maximum cardinality
- average degree
- evolving graphs
- real world graphs
- graph isomorphism
- random walk
- disk resident
- connected dominating set
- polynomial time complexity
- directed acyclic
- social graphs
- probability density function
- adjacency graph
- graphical models
- attributed graphs
- maximum common subgraph
- web graph
- edge weights
- graph patterns
- maximum independent set
- graph embedding
- proximity graph
- spectral decomposition
- maximal cliques
- topological information
- frequent subgraphs
- community discovery
- connected subgraphs
- small world
- link analysis
- finding the shortest path
- bounded treewidth
- complex networks
- strongly connected
- maximum clique