The Largest Minimum Codegree of a 3-Graph Without a Generalized 4-Cycle.
Edward MarchantPublished in: Comb. Probab. Comput. (2013)
Keyphrases
- spanning tree
- graph representation
- graph theory
- random walk
- connected components
- directed graph
- connected dominating set
- edge disjoint
- dominating set
- graph structure
- image segmentation
- graph partitioning
- data sets
- graph databases
- minimum cost
- directed acyclic graph
- bipartite graph
- graph clustering
- graph construction
- graph search
- dependency graph
- spectral clustering
- optimal solution