Results 71 to 80 of about 1,578 (264)

On the calculation of transitive reduction—closure of orders

Discrete Mathematics, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michel Habib, Michel Morvan, Jean-Xavier Rampon   +2 more
openaire   +2 more sources

Vertex Hashing Assignment‐Based Distributed Sampling Algorithm for Large‐Scale Dynamic Graph Stream

CAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT In recent years, research on triangle counting in large graphs has primarily focused on estimating the number of triangles in static graphs. Most streaming graph sampling algorithms are only capable of estimating triangle counts in static graphs and cannot handle dynamic graphs.
Yu‐Lin He, Gao‐Jie Liu, Bo Wu, Joshua Zhexue Huang   +3 more
wiley   +1 more source

Maximal independence and regularity of Al/Si distributions in disordered phyllosilicates 2:1

Acta Crystallographica Section A, EarlyView.
The distribution of aluminium cations in disordered phyllosilicates is analysed according to the concepts of maximal independence and regularity.As an extension of previous works, we analyse regularity in disordered Al/Si distributions in phyllosilicates 2:1. The method is based on an analysis of maximal independent sets in a labelled quotient graph of
Montauban Moreira de Oliveira Jr, Jean-Guillaume Eon   +1 more
wiley   +1 more source

Speeding Up Floyd–Warshall’s Algorithm to Compute All-Pairs Shortest Paths and the Transitive Closure of a Graph

Algorithms
Floyd–Warshall’s algorithm is a widely-known procedure for computing all-pairs shortest paths in a graph of n vertices in Θ(n3) time complexity. A simplified version of the same algorithm computes the transitive closure of the graph with the same time ...
Giuseppe Lancia, Marcello Dalpasso
doaj   +1 more source

Untested Feasibility as Progressive Performativity: Towards a Desirable Future Through Transformative Responsible Management Education

British Journal of Management, EarlyView.
Abstract The call for transformation in Management Education (ME) has intensified amid global crises, including the climate emergency, social inequality, and recurrent corporate misconduct. While Responsible Management Education (RME) has emerged in response to these challenges, it often struggles to move beyond symbolic gestures towards substantive ...
Janette Brunstein, Marcelo de Souza Bispo, Flavio Hourneaux Junior   +2 more
wiley   +1 more source

SOLVING QUICKEST PATH PROBLEM USING AN EXTENDED CONCEPT OF TRANSITIVE CLOSURE METHOD

Jurnal Informatika, 2005
A travel company offers a transportation service by picking up customers from certain places and sending them to the other places. Concerning traffic in time domain function for every path, the problem is how to find the quickest paths in picking up the ...
Rolly Intan
doaj  

Social networks in special schools: Friendships, bullying and play among pupils with special educational needs and disabilities

British Journal of Special Education, EarlyView.
Abstract Little is known about the social networks of children with special educational needs and disabilities (SEND) in specialist school settings—schools designed to support specific educational needs. Most literature on the social connections of children with SEND suggests that they have fewer friendships and are more involved in bullying situations,
Julia R. Badger, Lucy Robinson, Kimberly Winardi, Ariel Lindorff, Chloe Bracegirdle   +4 more
wiley   +1 more source

Transitivity of the εm-relation on (m-idempotent) hyperrings

Open Mathematics, 2018
On a general hyperring, there is a fundamental relation, denoted γ*, such that the quotient set is a classical ring. In a previous paper, the authors defined the relation εm on general hyperrings, proving that its transitive closure εm∗$\begin{array}{} \
Norouzi Morteza, Cristea Irina
doaj   +1 more source

There Is no First Phase of the Jespersen Cycle1

Transactions of the Philological Society, EarlyView.
Abstract This paper challenges the traditional conception of the Jespersen Cycle by arguing that no ‘pure’ first phase of the cycle exists where a single negator operates without reinforcement. Drawing on historical data from Northern Italian dialects (Piedmontese, Lombard, Emilian), we demonstrate that emphatic negative structures systematically co ...
Tommaso Mattiuzzi, Cecilia Poletto
wiley   +1 more source

On the Coherence of Probabilistic Relational Formalisms

Entropy, 2018
There are several formalisms that enhance Bayesian networks by including relations amongst individuals as modeling primitives. For instance, Probabilistic Relational Models (PRMs) use diagrams and relational databases to represent repetitive Bayesian ...
Glauber De Bona, Fabio G. Cozman
doaj   +1 more source