Results 121 to 130 of about 14,658 (182)

An efficient algorithm for the transversal hypergraph generation

open access: yes, 2008
The Transversal Hypergraph Generation is the problem of generating, given a hypergraph, the set of its minimal transversals, i.e., the hypergraph whose hyperedges are the minimal hitting sets of the given one.
Elias C. Stavropoulos   +1 more
core  

ON N-SOFT HYPERGRAPH

open access: yes
In this paper we explore the notion of N-soft hypergraphs, which is an hybridization of N-soft set and hypergraph. Next, we define strong N-soft hypergraphs, and induced complete N-soft hypergraphs.
Yanita Yanita   +3 more
core   +1 more source

ALGORITHM FOR ENUMERATING HYPERGRAPH TRANSVERSALS [PDF]

open access: yes, 2017
This paper introduces the hypergraph transversal problem along with thefollowing iterative solutions: naive, branch and bound, and dynamic exponentialtime (NC-D). Odometers are introduced along with the functions that manipulatethem.
Casita, Roscoe
core  

On the Coprime Labelings of Hypergraph

open access: yes
Graph labeling is the assignment of integers to the vertices, edges, or both, subject to certain conditions. Accordingly, hypergraph labeling is also the assignment of integers to the vertices, edges, or both, subject to certain conditions. This paper is

core   +1 more source

Hierarchical reduction and partition of hypergraph

open access: yes, 1996
In this paper, a hierarchical reduction method of hypergraphs is proposed. A macro-vertex in a reduced hypergraph corresponds to an edge of the original hypergraph, and thus a reduced hypergraph can provide a partition of a system.
Lee, Kwang-Hyung, Cho, CH
core  

HYPERGRAPH DAN BLOCK DESIGN

open access: yes
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

Home - About - Disclaimer - Privacy