Results 71 to 80 of about 3,203 (298)
On a Clique‐Building Game of Erdős
Journal of Graph Theory, EarlyView.ABSTRACT The following game was introduced in a list of open problems from 1983 attributed to Erdős: two players take turns claiming edges of a Kn ${K}_{n}$ until all edges are exhausted. Player 1 wins the game if the largest clique that they claim at the end is strictly larger than the largest clique of their opponent; otherwise, Player 2 wins the ...
Alexandru Malekshahian, Sam Spiro
wiley +1 more source
On the Hardness of Switching to a Small Number of Edges
Journal of Graph Theory, EarlyView.ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek +2 more
wiley +1 more source
Data Fragmentation for Parallel Transitive Closure Strategies [PDF]
, 1993 A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In [10] the disconnection set approach has been introduced as an effective strategy for such a computation.
Maurice A. W. Houtsma +4 more
core +4 more sources
Algebraic structures for transitive closure
Theoretical Computer Science, 1977 AbstractClosed semi-rings and the closure of matrices over closed semi-rings are defined and studied. Closed semi-rings are structures weaker than the structures studied by Conway [3] and Aho, Hopcroft and Ullman [1]. Examples of closed semi-rings and closure operations are given, including the case of semi-rings on which the closure of an element is ...
openaire +1 more source
Computing transitive closures of hedge transformations [PDF]
International Journal of Critical Computer-Based Systems, 2007 We consider the framework of regular hedge model checking where configurations are represented by trees of arbitrary arities, sets of configurations are represented by regular hedge automata, and the dynamic of a system is modelled by a term rewriting system. We consider the problem of computing the transitive closure R*(L) of a hedge automaton L and a
openaire +2 more sources
A Min–Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs
Journal of Graph Theory, EarlyView.ABSTRACT In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted digraph, the minimum weight of a dicut is equal to the maximum size of a packing of dijoins. This has been disproved. However, the unweighted version conjectured by
Gérard Cornuéjols, Siyue Liu, R. Ravi
wiley +1 more source
The Strong Nash‐Williams Orientation Theorem for Rayless Graphs
Journal of Graph Theory, EarlyView.ABSTRACT In 1960, Nash‐Williams proved his strong orientation theorem that every finite graph has an orientation in which the number of arc‐disjoint directed paths between any two vertices is at least half the number of undirected edge‐disjoint paths between them (rounded down).
Max Pitz, Jacob Stegemann
wiley +1 more source
Mantaining dynamic matrices for fully dynamic transitive closure [PDF]
, 2008 In this paper we introduce a general framework for casting fully dynamic transitive closure into the problem of reevaluating polynomials over matrices. With this technique, we improve the best known bounds for fully dynamic transitive closure.
DEMETRESCU, Camil +6 more
core +1 more source
Modelling Critical Impeding Factors of Gamification Adoption: An ISM‐MICMAC Analysis
Global Business and Organizational Excellence, EarlyView.ABSTRACT Gamification is a transformative technology that attracts consumers and motivates them toward desired actions through fun and engagement. Despite its growing popularity and influence on user behavior, gamification faces significant challenges in acceptance and implementation due to behavioral, technological, economic, and regulatory factors ...
Wamika Sharma +4 more
wiley +1 more source
Can the vector space model be used to identify biological entity activities?
BMC Genomics, 2011 Background Biological systems are commonly described as networks of entity interactions. Some interactions are already known and integrate the current knowledge in life sciences.
Maciel Wesley D +3 more
doaj +1 more source