Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs.
Andrzej CzygrinowPublished in: J. Graph Theory (2016)
Keyphrases
- lower bound
- random graphs
- upper bound
- search engine
- weighted graph
- sufficient conditions
- graph matching
- graph mining
- worst case
- graph theoretic
- graph representation
- graph partitioning
- case study
- graph construction
- subgraph isomorphism
- graph data
- degree distribution
- generalization error bounds
- graph structure
- complex structures
- databases
- np hard
- search algorithm
- data mining
- neural network