On Rank-Monotone Graph Operations and Minimal Obstruction Graphs for the Lovász-Schrijver SDP Hierarchy.
Yu Hin AuLevent TunçelPublished in: CoRR (2024)
Keyphrases
- stable set
- graph theory
- graph representation
- connected graphs
- graph matching
- graph structure
- graph theoretic
- graph construction
- directed graph
- labeled graphs
- weighted graph
- graph theoretical
- adjacency matrix
- graph structures
- graph model
- graph databases
- series parallel
- graph mining
- graph classification
- random graphs
- graph partitioning
- graph clustering
- subgraph isomorphism
- undirected graph
- graph properties
- graph data
- graph isomorphism
- dynamic graph
- structural pattern recognition
- bipartite graph
- graph layout
- graph search
- spanning tree
- reachability queries
- adjacency graph
- finding the shortest path
- maximum common subgraph
- minimum spanning tree
- bounded treewidth
- graph kernels
- boolean functions
- evolving graphs
- graph representations
- graph patterns
- neighborhood graph
- maximal cliques
- random walk
- planar graphs
- attributed graphs
- maximum clique
- semidefinite programming
- graph embedding
- community discovery
- directed acyclic
- structured data
- dense subgraphs
- connected components
- real world graphs
- web graph
- edge weights
- directed acyclic graph
- bounded degree
- shortest path
- massive graphs
- query graph
- semi supervised learning
- semidefinite
- linear programming