Results 21 to 30 of about 827,001 (270)
Efficient Processing of All Nearest Neighbor Queries in Dynamic Road Networks
Mathematics, 2021 The increasing trend of GPS-enabled smartphones has led to the tremendous usage of Location-Based Service applications. In the past few years, a significant amount of studies have been conducted to process All nearest neighbor (ANN) queries. An ANN query
Aavash Bhandari +4 more
doaj +1 more source
Engineering a Combinatorial Laplacian Solver: Lessons Learned
Algorithms, 2016 Linear system solving is a main workhorse in applied mathematics. Recently, theoretical computer scientists contributed sophisticated algorithms for solving linear systems with symmetric diagonally-dominant (SDD) matrices in provably nearly-linear time ...
Daniel Hoske +3 more
doaj +1 more source
On the Complexity of Finding a Sun in a Graph [PDF]
, 2010 The sun is the graph obtained from a cycle of length even and at least six by adding edges to make the even-indexed vertices pairwise adjacent. Suns play an important role in the study of strongly chordal graphs. A graph is chordal if it does not contain
Hoàng, Chính T.
core +2 more sources
Innovative Method of the Evaluation of Multicriterial Multicast Routing Algorithms
Journal of Telecommunications and Information Technology, 2013 Theoretical considerations of the multicast Quality of Service (QoS) routing have been a rapidly developing and dynamic research area for years. Several algorithms derived from different approaches have been proposed, while the pool of valid solutions ...
Krzysztof Stachowiak +1 more
doaj +1 more source
BibRank: Automatic Keyphrase Extraction Platform Using Metadata
Information, 2023 Automatic Keyphrase Extraction involves identifying essential phrases in a document. These keyphrases are crucial in various tasks, such as document classification, clustering, recommendation, indexing, searching, summarization, and text simplification ...
Abdelrhman Eldallal, Eduard Barbu
doaj +1 more source
, 2022 Graphs are widely-used mathematical structures visualized by two basic components: nodes and edges. Graph algorithms are used to solve the problems of representing graphs as networks like airline flights, how the Internet is connected, or social network connectivity on Facebook.
Khushbakov Sherzod +2 more
openaire +2 more sources
Tree Contraction, Connected Components, Minimum Spanning Trees: a GPU Path to Vertex Fitting [PDF]
, 2014 Standard parallel computing operations are considered in the context of algorithms for solving 3D graph problems which have applications, e.g., in vertex finding in HEP.
Hobson, PR, Lopes, RHC, Reid, ID
core +1 more source
Summary of Large-Scale Grapb Partitioning Algoritbms
Dianxin kexue, 2014 The large-scale graph partitioning algorithms were summarized and graph computing models in the distributed environment were introduced. Firstly the large-scale static graph partitioning algorithms and the dynamic graph partitioning algorithms were ...
Jinfeng Xu +4 more
doaj +2 more sources
A Global Community of Courts? Modelling the Use of Persuasive Authority as a Complex Network
Frontiers in Physics, 2021 There is a growing discussion in the legal literature of an emerging global community of courts composed of a network of increasing judicial dialogue across national borders.
D. Hoadley +16 more
doaj +1 more source
MultiAspect Graphs: Algebraic representation and algorithms
, 2016 We present the algebraic representation and basic algorithms for MultiAspect Graphs (MAGs). A MAG is a structure capable of representing multilayer and time-varying networks, as well as higher-order networks, while also having the property of being ...
Fleury, Éric +2 more
core +2 more sources