A Note on Enumeration of 3-Edge-Connected Spanning Subgraphs in Plane Graphs.
Yasuko MatsuiKenta OzekiPublished in: IEICE Trans. Inf. Syst. (2021)
Keyphrases
- graph mining
- graph databases
- weighted graph
- subgraph isomorphism
- subgraph matching
- connected subgraphs
- labeled graphs
- connected components
- graph properties
- graph structures
- undirected graph
- maximum common subgraph
- maximal cliques
- maximal clique enumeration
- graph theory
- reachability queries
- frequent subgraph mining
- graph patterns
- polynomial delay
- edge detection
- maximum clique
- graph data
- subgraph mining
- frequent subgraphs
- edge segments
- minimum spanning trees
- query graph
- search space
- topological information
- graph theoretic
- edge information
- graph matching
- directed graph
- graph clustering
- edge weights
- connected graphs
- quasi cliques
- graph structure
- data structure
- dynamic programming
- binary images
- edge detector
- graph model
- biological networks
- graph search
- vertex set