Results 21 to 30 of about 154,143 (266)
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
A Graph Pebbling Algorithm on Weighted Graphs
Journal of Graph Algorithms and Applications, 2010 A pebbling move on a weighted graph removes some pebbles at a vertex and adds one pebble at an adjacent vertex. The number of pebbles removed is the weight of the edge connecting the vertices. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that vertex using pebbling moves.
openaire +3 more sources
Graph algorithms for bioinformatics [PDF]
, 2015 Biological data are inherently interconnected: protein sequences are connected to their annotations, the annotations are structured into ontologies, and so on. While protein-protein interactions are already represented by graphs, in this work I am presenting how a graph structure can be used to enrich the annotation of protein sequences thanks to ...
openaire +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
CoRR, 2014 We are going to analyze local algorithms over sparse random graphs. These algorithms are based on local information where local regards to a decision made by the exploration of a small neighbourhood of a certain vertex plus a believe of the structure of the whole graph and maybe added some randomness.
David Gamarnik +2 more
openaire +2 more sources
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
Coloring Algorithms on Subcubic Graphs [PDF]
International Journal of Foundations of Computer Science, 2002 We present efficient algorithms for three coloring problems on subcubic graphs. (A subcubic graph has maximum degree at most three.) The first algorithm is for 4-edge coloring, or more generally, 4-list-edge coloring. Our algorithm runs in linear time, and appears to be simpler than previous ones.
San Skulrattanakulchai, Harold N. Gabow
openaire +1 more source
A simple algorithm for graph reconstruction
Random Structures & Algorithms, 2023 AbstractHow efficiently can we find an unknown graph using distance queries between its vertices? We assume that the unknown graph is connected, unweighted, and has bounded degree. The goal is to find every edge in the graph. This problem admits a reconstruction algorithm based on multi‐phase Voronoi‐cell decomposition and using distance queries.
Mathieu, Claire, Zhou, Hang
openaire +5 more sources