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