Results 21 to 30 of about 206,716 (316)
Undergraduate Students’ Solutions of Modeling Problems in Algorithmic Graph Theory
Mathematics, 2019 Graphs can be considered as useful mathematical models. Graph algorithms are a common part of undergraduate courses in discrete mathematics. Even though they have been successfully implemented in secondary curricula, little research has been dedicated to
Janka Medová +3 more
doaj +1 more source
Average Sensitivity of Graph Algorithms [PDF]
SIAM Journal on Computing, 2021 39 pages, 1 ...
Nithin Varma 0001, Yuichi Yoshida
openaire +2 more sources
Leanness Computation: Small Values and Special Graph Classes [PDF]
Discrete Mathematics & Theoretical Computer ScienceLet u and v be vertices in a connected graph G = (V, E). For any integer k such that 0 ≤ k ≤ dG (u, v), the k-slice Sk (u, v) contains all vertices x on a shortest uv-path such that dG (u, x) = k.
David Coudert +2 more
doaj +1 more source
CoRR, 2019 The goal of the LEDA project was to build an easy-to-use and extendable library of correct and efficient data structures, graph algorithms and geometric algorithms. We report on the use of formal program verification to achieve an even higher level of trustworthiness.
Abdulaziz, M., Mehlhorn, K., Nipkow, T.
openaire +4 more sources
A survey of two-dimensional graph layout techniques for information visualisation [PDF]
, 2012 Many algorithms for graph layout have been devised over the last 30 years spanning both the graph drawing and information visualisation communities. This article first reviews the advances made in the field of graph drawing that have then often been ...
Vickers, Paul, Gibson, Helen, Faith, Joe
core +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
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 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
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
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