Graph modification problem for some classes of graphs.
R. SritharanPublished in: J. Discrete Algorithms (2016)
Keyphrases
- graph theory
- graph representation
- graph structure
- directed graph
- graph theoretic
- graph construction
- adjacency matrix
- weighted graph
- graph mining
- labeled graphs
- graph classification
- bounded degree
- graph databases
- graph structures
- graph search
- graph matching
- directed acyclic
- graph clustering
- series parallel
- graph theoretical
- graph partitioning
- graph isomorphism
- graph model
- graph data
- subgraph isomorphism
- graph properties
- bipartite graph
- graph transformation
- random graphs
- structural pattern recognition
- minimum spanning tree
- undirected graph
- spanning tree
- graph representations
- dynamic graph
- edge weights
- maximum clique
- reachability queries
- graph layout
- planar graphs
- finding the shortest path
- maximum common subgraph
- disk resident
- connected dominating set
- evolving graphs
- association graph
- attributed graphs
- query graph
- community discovery
- real world graphs
- social graphs
- graph patterns
- neighborhood graph
- maximum independent set
- graph drawing
- shortest path
- connected graphs
- graph kernels
- graph embedding
- random walk
- polynomial time complexity
- average degree
- topological information
- inexact graph matching
- np complete
- pattern mining
- directed acyclic graph
- equivalence classes
- frequent subgraphs
- densely connected
- adjacency graph