Results 21 to 30 of about 832,082 (275)
Directed Representative Graph Modeling of MEP Systems Using BIM Data
Mechanical, electrical, and plumbing (MEP) systems are crucial to a building, which directly affect the building safety, energy saving, and operational efficiency.
Junjun Han +5 more
doaj +1 more source
Incidence Matrices of Directed Graphs of Groups and their up-down Pregroups
The aim of this work is to give a definition of the incidence matrices of the directed graph of groups, construct an up-down pregroup of the incidence matrices of the directed graph of groups and then give an algorithm for the up-down pregroup of the ...
Wadhah S. Jassim
doaj +1 more source
Asteroidal Quadruples in non Rooted Path Graphs
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are directed path graphs.
Gutierrez Marisa +2 more
doaj +1 more source
Replacement Paths via Row Minima of Concise Matrices [PDF]
Matrix $M$ is {\em $k$-concise} if the finite entries of each column of $M$ consist of $k$ or less intervals of identical numbers. We give an $O(n+m)$-time algorithm to compute the row minima of any $O(1)$-concise $n\times m$ matrix. Our algorithm yields
Lee, Cheng-Wei, Lu, Hsueh-I
core +1 more source
Extrema property of the k-ranking of directed paths and cycles
A k-ranking of a directed graph G is a labeling of the vertex set of G with k positive integers such that every directed path connecting two vertices with the same label includes a vertex with a larger label in between.
Breeanne Baker Swart +3 more
doaj +1 more source
Attractors of directed graph IFSs that are not standard IFS attractors and their Hausdorff measure [PDF]
For directed graph iterated function systems (IFSs) defined on R, we prove that a class of 2-vertex directed graph IFSs have attractors that cannot be the attractors of standard (1-vertex directed graph) IFSs, with or without separation conditions.
Barnsley +7 more
core +4 more sources
Social network data publishing is dynamic, and attackers can perform association attacks based on social network directed graph data at different times.
Xiaolin Zhang +3 more
doaj +1 more source
Search for the end of a path in the d-dimensional grid and in other graphs [PDF]
We consider the worst-case query complexity of some variants of certain \cl{PPAD}-complete search problems. Suppose we are given a graph $G$ and a vertex $s \in V(G)$.
Gerbner, Dániel +4 more
core +2 more sources
The Reduction of Directed Cyclic Graph for Task Assignment Problem
In this paper, a directed cyclic graph (DCG) is proposed as the task graph. It is undesirable and impossible to complete the task according to the constraints if the cycle exists.
Ariffin W.N.M.
doaj +1 more source
Design and Implementation of Solution Algorithm for Foreign Key Conflict Based on Directed Graph [PDF]
As one of the important constraints in relational databases,foreign keys play an important role in constraining the order of operations of the database.However,in some cases,users cannot know the order of operations,causing foreign key conflicts.To solve
WANG Zhiduo, JIANG Bo, MIAO Rui, ZHAO Hui
doaj +1 more source

