Results 11 to 20 of about 3,203 (298)
Transitive closure and transitive reduction in bidirected graphs [PDF]
Czechoslovak Mathematical Journal, 2019 In a bidirected graph an edge has a direction at each end, so bidirected graphs generalize directed graphs. We generalize the definitions of transitive closure and transitive reduction from directed graphs to bidirected graphs by introducing new notions of bipath and bicircuit that generalize directed paths and cycles.
Bessouf, Ouahiba +2 more
openaire +5 more sources
Transitive closure of interval-valued relations [PDF]
2008 3rd International Conference on Intelligent System and Knowledge Engineering, 2008 Peer ...
González del Campo, Ramón +2 more
core +7 more sources
Antifoundation and Transitive Closure in the System of Zermelo [PDF]
Notre Dame Journal of Formal Logic, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Esser, Olivier, Hinnion, Roland
openaire +4 more sources
The dynamic complexity of transitive closure is in DynTC0 [PDF]
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hesse, William
openaire +3 more sources
Causal Pathway Extraction from Web-Board Documents
Applied Sciences, 2021 This research aim is to extract causal pathways, particularly disease causal pathways, through cause-effect relation (CErel) extraction from web-board documents.
Chaveevan Pechsiri, Rapepun Piriyakul
doaj +1 more source
buTCS: An Optimized Algorithm for Estimating the Size of Transitive Closure
IEEE Access, 2021 Given a directed graph and a node $v$ , the transitive closure (TC) of $v$ is the set of nodes that $v$ can reach in the graph. TC size is very important in many applications but the cost of TC size computation is high in both time and space, which ...
Xiaozhe Li +3 more
doaj +1 more source
Model Checking Synchronized Products of Infinite Transition Systems [PDF]
Logical Methods in Computer Science, 2007 Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic has to be expressive enough to allow the formalization of reachability ...
Stefan Wöhrle, Wolfgang Thomas
doaj +1 more source
Complements and transitive closures
Discrete Mathematics, 1972 AbstractThe complement of the transitive closure of the complement of a transitive relation is transitive. We prove this fact in three ways, analyze the underlying structure and consider various refinement's and applications.
Ronald L. Graham +2 more
openaire +2 more sources
Parallel transitive closure algorithm [PDF]
Journal of the Brazilian Computer Society, 2012 Abstract Using the BSP/CGM model, with $$p$$ processors, where $$p \ll n$$ , we present a parallel algorithm to compute the transitive closure of a digraph $$D$$ with $$n$$ vertices and $$m$$ edges.
C. E. R. Alves +4 more
openaire +1 more source
Dual digraphs of finite semidistributive lattices
Cubo, 2022 Dual digraphs of finite join-semidistributive lattices, meet-semidistributive lattices and semidistributive lattices are characterised. The vertices of the dual digraphs are maximal disjoint filter-ideal pairs of the lattice.
Andrew Craig +2 more
doaj +1 more source