On isometric subgraphs of infinite bridged graphs and geodesic convexity.
Norbert PolatPublished in: Discret. Math. (2002)
Keyphrases
- graph mining
- graph databases
- graph properties
- subgraph isomorphism
- labeled graphs
- subgraph matching
- connected subgraphs
- graph data
- graph structures
- reachability queries
- frequent subgraphs
- maximum common subgraph
- frequent subgraph mining
- subgraph mining
- quasi cliques
- directed graph
- graph matching
- topological information
- euclidean space
- maximum clique
- maximal cliques
- data structure
- weighted graph
- dense subgraphs
- query graph
- bipartite graph
- distance transform
- graph patterns
- graph theoretic
- geodesic distance
- manifold learning
- undirected graph
- pattern mining
- graph structure
- graph search
- relational data
- convex hull
- shortest path
- graph model