Results 31 to 40 of about 1,372,330 (300)
OpenStreetMap provides a valuable crowd-sourced database of raw geospatial data for constructing models of urban street networks for scientific analysis.
Geoff Boeing
doaj +1 more source
Equitable Graph of a Graph [PDF]
A subset D of V is called an equitable dominating set if for every v ∈ V − D there exists a vertex u ∈ D such that uv ∈ E(G) and |d(u) − d(v)| ≤ 1 ,w hered(u) denotes the degree of vertex u and d(v) denotes the degree of vertex v. The minimum cardinality of such a dominating set is denoted by γ e and is called the equitable domination number of G ...
openaire +3 more sources
Orthogonality for (0, −1) tropical normal matrices
We study pairs of mutually orthogonal normal matrices with respect to tropical multiplication. Minimal orthogonal pairs are characterized. The diameter and girth of three graphs arising from the orthogonality equivalence relation are computed.
Bakhadly Bakhad+2 more
doaj +1 more source
Evaluation of Centrally Oriented Measures of Education by Project
Objective: this investigation aimed to assess the impact of applying project-based pedagogy to the topic of central trend measures and statistical graphs.
Adriana Granados-Comba+2 more
doaj +1 more source
THE k-INDEPENDENT GRAPH OF A GRAPH [PDF]
Let $G=(V,E)$ be a simple graph. A set $I\subseteq V$ is an independent set, if no two of its members are adjacent in $G$. The $k$-independent graph of $G$, $I_k (G)$, is defined to be the graph whose vertices correspond to the independent sets of $G$ that have cardinality at most $k$.
Abdul Jalil M. Khalaf+2 more
openaire +3 more sources
In architectural and construction system “Monofant” a self-supporting skeleton consisting of a spatial curvilinear framework and unrecoverable hollow-core inserts made of expanded polystyrene was used to erect buildings and structures of curved shapes ...
Bugayevskiy Sergey+3 more
doaj +1 more source
Variable neighborhood search for minimum linear arrangement problem [PDF]
The minimum linear arrangement problem is widely used and studied in many practical and theoretical applications. It consists of finding an embedding of the nodes of a graph on the line such that the sum of the resulting edge lengths is ...
Mladenović Nenad+2 more
doaj +1 more source
Heuristic search algorithms are informed search strategies that use heuristics to estimate the minimal cost of the path from the current state to the goal. Using this additional knowledge, this type of algorithms can distinguish non-goal states, and then
Ouardi Amine, Mestari Mohammed
doaj +1 more source
Geometric Deep Learning on Graphs and Manifolds Using Mixture Model CNNs [PDF]
Deep learning has achieved a remarkable performance breakthrough in several fields, most notably in speech recognition, natural language processing, and computer vision.
Federico Monti+5 more
semanticscholar +1 more source
Modern video-based head-mounted displays allow users to operate along Milgram’s entire reality-virtuality continuum. This opens up the field for novel cross-reality applications that distribute data analytics tasks along this continuum to combine ...
Daniel Schwajda+4 more
doaj +1 more source