Results 111 to 120 of about 698,372 (216)
BLOCK DESIGN DENGAN PENDEKATAN DEGREE SEQUENCE k-UNIFORM HYPERGRAPH
Suatu hypergraph H didefinisikan sebagai pasangan himpunan ( , ), di mana = { 1, 2, … , } adalah himpunan berhingga dari vertex dan = { 1, 2, … , } merupakan himpunan hyperedge di mana , ∈ {1,2, … , } adalah subset dari ...
SIPAHUTAR, RIA LESTARI MUJIATI +2 more
core +2 more sources
Random hypergraph irregularity
, 2016 A hypergraph is k-irregular if there is no set of k vertices all of which have the same degree.
Bollobás, Béla +3 more
core +1 more source
Complement Reducible Uniform Hypergraphs
AxiomsWe investigate a generalization of complement reducible graphs, called co-graphs, for r-uniform hypergraphs. The operations of r-co-hypergraphs are the disjoint union of two given r-co-hypergraphs and the join operation, which inserts all hyperedges of ...
Frank Gurski, Jochen Rethmann
doaj +1 more source
Enumeration of unlabeled uniform hypergraphs
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence.
PLoS ONEPartite, 3-uniform hypergraphs are 3-uniform hypergraphs in which each hyperedge contains exactly one point from each of the 3 disjoint vertex classes. We consider the degree sequence problem of partite, 3-uniform hypergraphs, that is, to decide if such ...
András Hubai +4 more
doaj +1 more source
The maximum Wiener index of a uniform hypergraph
, 2023 The Wiener index of a (hyper)graph is calculated by summing up the distances between all pairs of vertices. We determine the maximum possible Wiener index of a connected $n$-vertex $k$-uniform hypergraph and characterize for every~$n$ all hypergraphs ...
Tuite, James +4 more
core
The Hardness of 3-Uniform Hypergraph Coloring
, 2004 We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n 1/5) colors.
Oded Regev, Clifford Smyth, Irit Dinur
core
Hypergraph neural networks: from signal processing to convolution, u-nets and beyond
Arce, Gonzalo R.Qian, WeiNetwork data has gained significant attention in signal processing and machine learning communities. Existing research mainly centers on simple graphs, which depict only pairwise connections.
Wang, Fuli
core +1 more source
Recent Experiences and Future Developments on the Validation of Finite Element Models for Spaceflight Hardware [PDF]
, 2008 Uncertainties quantification in simulation results and experimental data is a fundamental aspect in validation of finite element (FE) models [1]. Some methodologies and procedures for model updating and validation of spacecraft structural dynamics models
D’Amico, J. +2 more
core
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