Solving the Graph Burning Problem for Large Graphs.
Felipe de C. PereiraPedro Jussieu de RezendeTallys H. YunesLuiz Fernando Batista MoratoPublished in: CoRR (2024)
Keyphrases
- graph representation
- graph theory
- graph theoretic
- directed graph
- graph matching
- graph databases
- graph structure
- labeled graphs
- graph properties
- graph construction
- distributed sensor networks
- subgraph isomorphism
- weighted graph
- graph mining
- series parallel
- graph structures
- random graphs
- graph classification
- graph theoretical
- adjacency matrix
- graph data
- graph isomorphism
- undirected graph
- graph model
- graph search
- graph partitioning
- graph clustering
- spanning tree
- graph kernels
- bipartite graph
- dynamic graph
- graph transformation
- graph layout
- connected dominating set
- graph drawing
- directed acyclic
- graph representations
- evolving graphs
- reachability queries
- disk resident
- structural pattern recognition
- social graphs
- minimum spanning tree
- edge weights
- inexact graph matching
- maximum common subgraph
- structured data
- frequent subgraphs
- finding the shortest path
- maximum cardinality
- real world graphs
- strongly connected
- planar graphs
- bounded treewidth
- massive graphs
- random walk
- dense subgraphs
- pattern mining
- average degree
- connected components
- adjacency graph
- web graph
- directed acyclic graph
- vertex set
- connected graphs
- topological information
- neighborhood graph
- fully connected
- graphical models