NP-completeness Results for Graph Burning on Geometric Graphs.
Arya Tanmay GuptaSwapnil A. LokhandeKaushik MondalPublished in: CoRR (2020)
Keyphrases
- graph theoretical
- graph theory
- graph representation
- weighted graph
- graph structure
- graph construction
- topological information
- directed graph
- graph matching
- graph theoretic
- graph model
- adjacency matrix
- graph databases
- labeled graphs
- graph mining
- graph partitioning
- series parallel
- subgraph isomorphism
- graph classification
- undirected graph
- graph search
- graph structures
- graph clustering
- bipartite graph
- graph properties
- random graphs
- maximum independent set
- spanning tree
- maximum common subgraph
- graph data
- graph kernels
- structural pattern recognition
- directed acyclic
- minimum spanning tree
- dynamic graph
- connected graphs
- graph isomorphism
- graph representations
- reachability queries
- adjacency graph
- graph transformation
- evolving graphs
- attributed graphs
- real world graphs
- graph patterns
- average degree
- disk resident
- inexact graph matching
- web graph
- random walk
- maximum clique
- edge weights
- connected components
- finding the shortest path
- dense subgraphs
- graph layout
- pattern mining
- connected dominating set
- proximity graph
- consistency check
- graph drawing
- community discovery
- geometric structure
- structured data