Results 221 to 227 of about 40,185 (227)
Some of the next articles are maybe not open access.
Mathematical Programming, 1997
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network
CAMBINI, RICCARDO +2 more
openaire +4 more sources
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network
CAMBINI, RICCARDO +2 more
openaire +4 more sources
2016
We introduce sequence hypergraphs by extending the concept of a directed edge (from simple directed graphs) to hypergraphs. Specifically, every hyperedge of a sequence hypergraph is defined as a sequence of vertices (imagine it as a directed path). Note that this differs substantially from the standard definition of directed hypergraphs.
Böhmovà, Kateřina +4 more
openaire +6 more sources
We introduce sequence hypergraphs by extending the concept of a directed edge (from simple directed graphs) to hypergraphs. Specifically, every hyperedge of a sequence hypergraph is defined as a sequence of vertices (imagine it as a directed path). Note that this differs substantially from the standard definition of directed hypergraphs.
Böhmovà, Kateřina +4 more
openaire +6 more sources
Journal of Soviet Mathematics, 1984
Translation from Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 114, 196-204 (Russian) (1982; Zbl 0499.05045).
openaire +3 more sources
Translation from Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 114, 196-204 (Russian) (1982; Zbl 0499.05045).
openaire +3 more sources
Algebra Universalis, 1996
A commutative quasi-hypergroup \(H_\Gamma\) is associated to a given hypergraph \(\Gamma\). Necessary and sufficient conditions for \(H_\Gamma\) to be associative are found. For certain classes of hypergraphs that include finite hypergraphs, a sequence of hypergraphs is described such that the corresponding quasi-hypergroups form a join space.
openaire +4 more sources
A commutative quasi-hypergroup \(H_\Gamma\) is associated to a given hypergraph \(\Gamma\). Necessary and sufficient conditions for \(H_\Gamma\) to be associative are found. For certain classes of hypergraphs that include finite hypergraphs, a sequence of hypergraphs is described such that the corresponding quasi-hypergroups form a join space.
openaire +4 more sources