A Note on Generalized Lagrangians of Non-uniform Hypergraphs
Sign Up to like & getrecommendations! Published in 2017 at "Order"
DOI: 10.1007/s11083-016-9385-0
Abstract: Set A⊂ℕ$A\subset {\mathbb N}$ is less than B⊂ℕ$B\subset {\mathbb N}$ in the colex ordering if max(A△B)∈B. In 1980’s, Frankl and Füredi conjectured that the r-uniform graph with m edges consisting of the first m sets… read more here.
Keywords: colex ordering; edge type; question; uniform hypergraphs ... See more keywords
Encoding edge type information in graphlets
Sign Up to like & getrecommendations! Published in 2022 at "PLoS ONE"
DOI: 10.1371/journal.pone.0273609
Abstract: Graph embedding approaches have been attracting increasing attention in recent years mainly due to their universal applicability. They convert network data into a vector space in which the graph structural information and properties are maximumly… read more here.
Keywords: edge type; type information; information graphlets; edge ... See more keywords