Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs.
Fábio ProttiUéverton S. SouzaPublished in: Discret. Math. Theor. Comput. Sci. (2018)
Keyphrases
- graph matching
- maximum cardinality
- subgraph isomorphism
- graph matching algorithm
- bipartite graph
- graph representation
- adjacency matrix
- association graph
- attributed relational graph
- graph theory
- graph databases
- graph construction
- directed graph
- inexact graph matching
- graph model
- graph structure
- labeled graphs
- graph mining
- matching algorithm
- graph theoretic
- random graphs
- weighted graph
- directed acyclic
- graph search
- graph theoretical
- bounded degree
- graph classification
- maximum weight
- series parallel
- graph isomorphism
- attributed graphs
- pattern matching
- graph structures
- graph clustering
- graph partitioning
- structural pattern recognition
- structural information
- graph embedding
- spanning tree
- dense subgraphs
- maximum clique
- structural patterns
- graph kernels
- graph representations
- graph properties
- image matching
- graph transformation
- reachability queries
- undirected graph
- random walk
- maximum common subgraph
- dynamic graph
- graph drawing
- adjacency graph
- graph data
- neighborhood graph
- topological information
- social graphs
- real world graphs
- edit distance
- quasi cliques
- minimum weight