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