Graph Square Roots of Small Distance from Degree One Graphs.
Petr A. GolovachPaloma T. LimaCharis PapadopoulosPublished in: CoRR (2020)
Keyphrases
- random graphs
- graph representation
- graph structure
- graph matching
- graph theory
- graph theoretic
- directed graph
- graph model
- graph construction
- graph clustering
- graph properties
- weighted graph
- graph databases
- edge weights
- neighborhood graph
- graph mining
- labeled graphs
- adjacency matrix
- graph classification
- graph structures
- graph data
- degree distribution
- graph partitioning
- graph search
- bipartite graph
- series parallel
- graph kernels
- spanning tree
- graph representations
- subgraph isomorphism
- inexact graph matching
- dynamic graph
- graph transformation
- real world graphs
- social graphs
- maximum common subgraph
- query graph
- graph theoretical
- graph isomorphism
- structural pattern recognition
- undirected graph
- graph drawing
- minimum spanning tree
- graph embedding
- connected dominating set
- topological information
- attributed graphs
- distance measure
- finding the shortest path
- evolving graphs
- maximum cardinality
- seed set
- edit distance
- graph layout
- web graph
- power law
- bounded treewidth
- adjacency graph
- disk resident
- small world
- social networks
- directed acyclic
- clustering coefficient
- structured data
- shortest path
- planar graphs