Partition of the edges of the directed complete graph into 4-cycles.
Johanan SchönheimPublished in: Discret. Math. (1975)
Keyphrases
- vertex set
- directed graph
- weighted graph
- spanning tree
- undirected graph
- directed acyclic graph
- partitioning algorithm
- edge weights
- graph theory
- graph structure
- random walk
- graph representation
- nodes of a graph
- normalized cut
- graph theoretic
- directed edges
- neural network
- min cut
- structured data
- shortest path
- stable set
- spectral embedding
- maximum matching
- graph matching
- connected components
- random graphs
- adjacency matrix
- dependency graph
- graph based algorithm
- densely connected
- graph cuts
- pairwise