Results 131 to 140 of about 8,099 (222)

Oriented hypergraphs

open access: yes, 2010
The column dependencies of {0,±1}-matrices which contain at most two non-zero entries in each column have been characterized using orientations of graphs and signed graphs. We introduce a hypergraphic model of {0,±1}-matrices, called oriented hypergraphs,
Rusnak, Lucas J.
core  

Scarf’s Algorithm on Arborescence Hypergraphs [PDF]

open access: yes
Scarf’s algorithm - a pivoting procedure that finds a dominating extreme point in a down-monotone polytope - can be used to show the existence of a fractional stable matching in hypergraphs.
Sethuraman, Jay   +3 more
core   +1 more source

K shortest paths in stochastic time-dependent networks [PDF]

open access: yes
A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent.
Andersen, Kim Allan   +2 more
core  

Sampling nodes and hyperedges via random walks on large hypergraphs

open access: yesApplied Network Science
Hypergraphs provide a fundamental framework for representing complex systems involving interactions among three or more entities. As empirical hypergraphs grow in size, characterizing their structural properties becomes increasingly challenging due to ...
Kazuki Nakajima   +2 more
doaj   +1 more source

Hypergraphs

open access: yes
Tool & library to visualize and edit sourced labelled hypergraphs,compute their treewidth, decompose them into prime ...
Pous, Damien
core   +1 more source

On Unavoidable Infinite Hypergraphs

open access: yes
Ramsey\u27s Theorem states that every infinite graph contains either K∞ or $\overline{K∞}$ as an induced subgraph. For this reason, K∞ and $\overline{K∞}$ are often referred to as the unavoidable infinite graphs.
Weiner, Samuel
core   +1 more source

Interaction on hypergraphs [PDF]

open access: yes, 2005
Interaction on hypergraphs generalizes interaction on graphs, also known as pairwise local interaction. For games played on a hypergraph which are supermodular potential games, logit-perturbed best-response dynamics are studied. We find that the associated stochastically stable states form a sublattice of the lattice of Nash equilibria and derive ...
Durieu, Jacques   +2 more
openaire   +1 more source

Information theory for hypergraph similarity. [PDF]

open access: yesSci Adv
Felippe H, Kirkley A, Battiston F.
europepmc   +1 more source

Spherical fuzzy hypergraph in decision making. [PDF]

open access: yesSci Rep
Pramanik T   +5 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy