Results 61 to 70 of about 10,205 (230)
Computer Science Journal of Moldova, 1993 We introduce the notion of an anti-edge of a hypergraph, which is a non-overall polychromatic subset of vertices. The maximal number of colors, for which there exists a coloring of a hypergraph using all colors, is called an upper chromatic number of a ...
V. Voloshin
doaj
Semisupervised Hypergraph Discriminant Learning for Dimensionality Reduction of Hyperspectral Image
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2020 Semisupervised learning is an effective technique to represent the intrinsic features of a hyperspectral image (HSI), which can reduce the cost to obtain the labeled information of samples.
Fulin Luo +4 more
doaj +1 more source
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová +3 more
wiley +1 more source
Uniform hypergraphs containing no grids
, 2013 A hypergraph is called an r×r grid if it is isomorphic to a pattern of r horizontal and r vertical lines, i.e.,a family of sets {A1, ..., Ar, B1, ..., Br} such that Ai∩Aj=Bi∩Bj=φ for 1 ...
Füredi, Zoltán, Ruszinkó, Miklós
core +1 more source
Multiview Hypergraph Fusion Network for Change Detection in High-Resolution Remote Sensing Images
IEEE Journal of Selected Topics in Applied Earth Observations and Remote SensingCurrently, convolutional neural networks and transformers have been the dominant paradigms for change detection (CD) thanks to their powerful local and global feature extraction capabilities. However, with the improvement of resolution, spatial, spectral,
Xue Zhao +5 more
doaj +1 more source
Density Conditions for k $k$ Vertex‐Disjoint Triangles in Tripartite Graphs
Journal of Graph Theory, EarlyView.ABSTRACT Let n , k $n,k$ be positive integers such that n ≥ k $n\ge k$ and G $G$ be a tripartite graph with parts A , B , C $A,B,C$ such that ∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n $| A| =| B| =| C| =n$. Denote the edge densities of G [ A , B ] , G [ A , C ] $G[A,B],G[A,C]$ and G [ B , C ] $G[B,C]$ by α , β $\alpha ,\beta $ and γ $\gamma $, respectively.
Mingyang Guo, Klas Markström
wiley +1 more source
Combinatorics, Probability and ComputingAbstract For $\ell \geq 3$ , an $\ell$
Lior Gishboliner, Ethan Honest
openaire +2 more sources
Multi-grained hypergraph interest modeling for conversational recommendation
AI Open, 2023 Conversational recommender system (CRS) interacts with users through multi-turn dialogues in natural language, which aims to provide high-quality recommendations for user’s instant information need.
Chenzhan Shang +4 more
doaj +1 more source
An Extended Formulation With Valid Inequalities for the Capacitated Steiner Arborescence Problem
Networks, EarlyView.ABSTRACT Given a directed graph, the Capacitated Steiner Arborescence Problem (CSAP) aims to determine the least‐cost connection from the root node to terminal nodes requiring a demand through Steiner nodes coming with a capacity, such that there is a unique path from the root to each terminal. This paper presents a new extended formulation of the CSAP,
Francesco Contu +3 more
wiley +1 more source
Weak hypergraph regularity and linear hypergraphs
Journal of Combinatorial Theory, Series B, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yoshiharu Kohayakawa +3 more
openaire +2 more sources