Results 1 to 10 of about 832,460 (272)
Engineering a Combinatorial Laplacian Solver: Lessons Learned
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
BibRank: Automatic Keyphrase Extraction Platform Using Metadata
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
Innovative Method of the Evaluation of Multicriterial Multicast Routing Algorithms
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
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
Diameter and Treewidth in Minor-Closed Graph Families
It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families.
Eppstein, David
core +2 more sources
A Global Community of Courts? Modelling the Use of Persuasive Authority as a Complex Network
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
Parameterized Algorithms for Graph Partitioning Problems [PDF]
We study a broad class of graph partitioning problems, where each problem is specified by a graph $G=(V,E)$, and parameters $k$ and $p$. We seek a subset $U\subseteq V$ of size $k$, such that $\alpha_1m_1 + \alpha_2m_2$ is at most (or at least) $p ...
A Donavalli +12 more
core +1 more source
Summary of Large-Scale Grapb Partitioning Algoritbms
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
Graphulo: Linear Algebra Graph Kernels for NoSQL Databases
Big data and the Internet of Things era continue to challenge computational systems. Several technology solutions such as NoSQL databases have been developed to deal with this challenge.
Bolewski, Jake +5 more
core +1 more source
Truly Online Paging with Locality of Reference
The competitive analysis fails to model locality of reference in the online paging problem. To deal with it, Borodin et. al. introduced the access graph model, which attempts to capture the locality of reference.
Fiat, Amos, Mendel, Manor
core +1 more source

