On Infinite Cycles in Graphs: Or How to Make Graph Homology Interesting.
Reinhard DiestelPublished in: Am. Math. Mon. (2004)
Keyphrases
- homology generators
- graph representation
- graph structure
- directed graph
- graph theoretic
- graph theory
- graph construction
- labeled graphs
- weighted graph
- graph databases
- graph structures
- series parallel
- graph matching
- graph search
- graph properties
- graph mining
- densely connected
- adjacency matrix
- graph model
- undirected graph
- graph classification
- graph theoretical
- spanning tree
- random graphs
- structural pattern recognition
- subgraph isomorphism
- graph clustering
- graph data
- graph partitioning
- bipartite graph
- reachability queries
- graph isomorphism
- graph kernels
- graph representations
- directed acyclic
- graph drawing
- minimum spanning tree
- evolving graphs
- connected graphs
- connected dominating set
- dynamic graph
- graph transformation
- digital images
- edge weights
- neighborhood graph
- attributed graphs
- connected components
- graph patterns
- maximal cliques
- community discovery
- maximum clique
- maximum common subgraph
- finding the shortest path
- disk resident
- graph layout
- query graph
- random walk
- inexact graph matching
- massive graphs
- proximity graph
- strongly connected
- hyper graph
- adjacency graph
- association graph
- protein interaction networks
- bounded treewidth
- polynomial time complexity
- social graphs
- topological information
- web graph
- maximum independent set