Complementary Graph Entropy, AND Product, and Disjoint Union of Graphs.
Nicolas CharpenayMaël Le TreustAline RoumyPublished in: CoRR (2023)
Keyphrases
- graph theory
- graph matching
- graph structure
- weighted graph
- directed graph
- graph representation
- graph construction
- adjacency matrix
- graph theoretic
- labeled graphs
- graph model
- series parallel
- graph structures
- graph theoretical
- graph classification
- graph databases
- graph clustering
- graph properties
- graph mining
- random graphs
- subgraph isomorphism
- graph partitioning
- graph isomorphism
- graph search
- graph data
- bipartite graph
- dynamic graph
- minimum spanning tree
- disk resident
- graph kernels
- graph patterns
- evolving graphs
- connected graphs
- reachability queries
- pairwise
- graph transformation
- web graph
- polynomial time complexity
- adjacency graph
- spanning tree
- small world
- random walk
- undirected graph
- structural pattern recognition
- graph drawing
- graph representations
- directed acyclic
- planar graphs
- edge weights
- bounded treewidth
- neighborhood graph
- connected dominating set
- average degree
- shortest path
- finding the shortest path
- real world graphs
- maximum clique
- attributed graphs
- maximal cliques
- maximum independent set
- inexact graph matching
- hyper graph
- social networks
- query graph
- dense subgraphs
- graph layout
- maximum cardinality
- community discovery
- community detection
- maximum common subgraph
- mutual information
- massive graphs
- strongly connected
- spectral decomposition
- information theoretic
- dominating set
- fully connected
- link prediction