A partial characterization by forbidden subgraphs of edge path graphs.
Márcia R. CerioliHugo NobregaPetrucio VianaPublished in: CTW (2011)
Keyphrases
- weighted graph
- graph mining
- subgraph isomorphism
- graph databases
- subgraph matching
- labeled graphs
- shortest path
- edge weights
- graph properties
- connected subgraphs
- subgraph mining
- strongly connected
- undirected graph
- graph structures
- topological information
- maximum common subgraph
- reachability queries
- minimum spanning trees
- frequent subgraph mining
- directed graph
- graph data
- edge detection
- graph theoretic
- maximum clique
- maximal cliques
- query graph
- dense subgraphs
- graph patterns
- frequent subgraphs
- graph matching
- edge information
- disjoint paths
- graph structure
- pattern mining
- optimal path
- graph clustering
- adjacency graph
- data structure
- quasi cliques
- labeling scheme
- graph theory
- vertex set
- random graphs
- graph model
- search tree
- densely connected
- bipartite graph
- edge map
- graph representation
- edge detector
- community discovery
- finding the shortest path
- biological networks