Hypergraph: A Unified and Uniform Definition with Application to Chemical Hypergraph and More
The conventional definition of hypergraph has two major issues: (1) there is not a standard definition of directed hypergraph and (2) there is not a formal definition of nested hypergraph.
Chang, Daniel T.
core
Fuzzy Hypergraph Clustering via Higher-Order Modularity Maximization
MathematicsConventional clustering methods mainly characterize cluster structures using geometric proximity or pairwise similarities, which may be insufficient for data with complex higher-order dependencies.
Yichen Sun +4 more
doaj +1 more source
Online matching on 3-uniform hypergraphs
Mathematical ProgrammingAbstract The online matching problem was introduced by Karp, Vazirani and Vazirani (STOC 1990) on bipartite graphs with vertex arrivals. It is well-known that the optimal competitive ratio is $$1-1/e$$
S.J. Borst (Sander) +2 more
openaire +7 more sources
Recognizing the P 4-structure of claw-free graphs and a larger graph class
Discrete Mathematics & Theoretical Computer Science, 2002 The P 4-structure of a graph G is a hypergraph H on the same vertex set such that four vertices form a hyperedge in H whenever they induce a P 4 in G.
Luitpold Babel +2 more
doaj
The Ramsey number for hypergraph cycles, I.
, 2005 Let Cn denote the 3-uniform hypergraph loose cycle, that is the hypergraph with vertices v1,..., vn and edges v1v2v3, v3v4v5, v5v6v7,..., vn−1vnv1. We prove that every red-blue colouring of the edges of the complete 3-uniform hypergraph with N vertices ...
M. Simonovits +5 more
core
Maximum Packing of λ-Fold Complete 3-Uniform Hypergraph with a Special Tetrahedron
Let Kv(3)=(V,E) be the complete 3-uniform hypergraph, where the vertex set is V={x1,x2,⋯,xv}, in which the edge set E is of all triples. Let ST denote the special tetrahedron with four edges, where each edge contains three vertices of degree 2.
Yuzhe Zhu, Hongtao Zhao
core +1 more source
Suatu hypergraph didefinisikan sebagai pasangan himpunan ( , ) di mana = * 1, 2, … , + adalah himpunan berhingga dari n vertices dan = * | ⊆ V, = 1,2, … , + adalah himpunan hyperedge.
SAPUTRA, GILANG ANDI JAYA +2 more
core +1 more source
An infinite family of connected 1-factorisations of complete 3-uniform hypergraphs
A connected 1-factorisation is a 1-factorisation of a hypergraph for which the union of each pair of distinct 1-factors is a connected hypergraph. A uniform 1-factorisation is a 1-factorisation of a hypergraph for which the union of each pair of distinct
Puskas, Anna +2 more
core +1 more source
ASSET-DETR: a relation-aware multi-scale feature arbitration network for real-time weed detection in sugar beet fields. [PDF]
Front Plant SciLiu H, Wei L, Hou P, Hu Y, Ding Y, Li Y.
europepmc +1 more source
Graph and Hypergraph Theories Applied to Dynamic Protein-Protein Interaction Network Analysis, and Deep-Learning Frameworks for Protein Complex Network Prediction. [PDF]
Int J Mol SciChan KY +4 more
europepmc +1 more source