Edge partitions of the countable triangle free homogeneous graph.
Norbert SauerPublished in: Discret. Math. (1998)
Keyphrases
- vertex set
- weighted graph
- undirected graph
- disjoint paths
- edge weights
- graph theory
- graph representation
- edge information
- directed graph
- strongly connected
- adjacency matrix
- graph partitioning
- equivalence classes
- structured data
- graph theoretic
- shortest path
- random walk
- markov chain
- neural network
- graph model
- graph structure
- bipartite graph
- connected components
- edge map
- data sets
- directed acyclic graph
- minimum spanning tree
- graph based algorithm
- markov random field
- edge detection
- densely connected