Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs.
Dmitriy KuniskyXifan YuPublished in: CoRR (2024)
Keyphrases
- graph properties
- graph theory
- graph theoretic
- directed graph
- weighted graph
- graph representation
- graph matching
- graph structure
- graph classification
- graph model
- graph construction
- graph databases
- graph clustering
- graph mining
- spanning tree
- adjacency matrix
- graph partitioning
- graph search
- graph structures
- series parallel
- neighborhood graph
- graph theoretical
- reachability queries
- dense subgraphs
- structural pattern recognition
- bipartite graph
- labeled graphs
- graph representations
- degree distribution
- graph data
- subgraph isomorphism
- undirected graph
- directed acyclic
- evolving graphs
- real world graphs
- graph layout
- maximum common subgraph
- connected graphs
- topological information
- planar graphs
- maximal cliques
- graph kernels
- random graphs
- minimum spanning tree
- random instances
- attributed graphs
- graph isomorphism
- graph transformation
- edge weights
- phase transition
- np complete
- upper bound
- inexact graph matching
- np hard