Flows and parity subgraphs of graphs with large odd-edge-connectivity.
Jinlong ShuCun-Quan ZhangTaoye ZhangPublished in: J. Comb. Theory, Ser. B (2012)
Keyphrases
- topological information
- graph mining
- weighted graph
- graph databases
- subgraph isomorphism
- graph properties
- connected components
- subgraph matching
- undirected graph
- labeled graphs
- graph structures
- graph data
- connected subgraphs
- reachability queries
- strongly connected
- frequent subgraph mining
- maximum common subgraph
- graph patterns
- graph theoretic
- edge information
- edge detection
- subgraph mining
- dense subgraphs
- graph structure
- maximum clique
- minimum spanning trees
- frequent subgraphs
- graph representation
- error correction
- graph theory
- graph connectivity
- data structure
- quasi cliques
- d objects
- structural information
- link prediction
- edge weights
- maximal cliques
- query language