A path in a properly edge-colored graph is rainbow if its edges have pairwise distinct colors. For a proper edge-coloring $c$ of a graph $G$, let $\operatorname{rpc}(G,c)$ be the minimum number of rainbow paths needed to cover $E(G)$, and let $\operatorname{rpc}(G)$ be the maximum of $\operatorname{rpc}(G,c)$ over all...
Let $k\geq2$ be an integer. A $1\bmod k$ edge-coloring of a graph $G$ is an edge-coloring in which every nonzero degree in each color class is congruent to $1$ modulo $k$. Let $\chi'_k(G)$ denote the minimum number of colors required, and let $\chi'_k$ be the supremum of $\chi'_k(G)$ over all finite simple graphs $G$....
Non-Euclidean spaces inherently enable high-fidelity embeddings for hierarchical and cyclical data due to their geometric properties. Existing approaches unify hyperbolic and spherical embeddings within the framework of constant curvature spaces. However, current methods for Lipschitz regularization remain limited to n...
Yang Shi, Jingchao Wang, Liangsi Lu et al.· ACM Transactions on Knowledg...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.