Search results

{{short description|Graph data structure}} ...ath> array of lists.<ref>{{Cite book|title=Statistical analysis of network data : methods and models|url=https://archive.org/details/statisticalanaly00kola ...

{{Short description|Kinetic data structure}} ...c data structure]] that maintains the [[minimum spanning tree]] (MST) of a graph whose edge weights are changing as a continuous function of time. ...

A '''kinetic Euclidean minimum spanning tree''' is a [[kinetic data structure]] that maintains the [[Euclidean minimum spanning tree]] (EMST) o ...the EMST in [[Polylogarithmic time|polylog time]] per event. Their kinetic data structure handles <math>O(n*m)</math> events, where m is the number of all ...

...is | last1 = Rahmati | first1 = Zahed | title= Simple, Faster Kinetic Data Structures | publisher = University of Victoria | url= https://cs.uwaterloo.ca/~zrahm | year = 2014}}</ref> It is named for its relation to the [[Yao graph]], which is named after [[Andrew Yao]]. ...

{{Short description|Data structure for anagram solving}} ...|volume=17|issue=1 |pages=2012 |doi=10.1145/2133803.2133804}}</ref> is a [[data structure]] designed to solve [[anagram]]s. Solving an anagram is the probl ...

...umb|Southwell Plot constructed from a straight line fitted to experimental data points.]] ...November 20, 2016, from http://www.colorado.edu/engineering/CAS/courses.d/Structures.d/IAST.Lect26.d/IAST.Lect26.pdf</ref> ...

'''Skip graphs''' are a kind of distributed data structure based on [[skip list]]s. A nearly identical data structure called SkipNet was independently invented by Nicholas Harvey, Mic ...

...te=1997-04-01 |title=Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation |url=https://doi.org/10.1023/A:10086478 ...rier of the [[algebraic structure]]. An ADD is a rooted, directed, acyclic graph, which has several nodes, like a BDD. However, an ADD can have more than tw ...

{{Short description|Method used in automata theory to represent tree structures using arithmetical sequences}} {{for|various other data structures implementing hierarchies in mathematics and computer science|Tree (disambig ...

...] for calculating distances between vertices in a [[Graph (data structure)|graph]]. Let ''G''(''V'',''E'') be an undirected, weighted graph, with ''n''&nbsp;=&nbsp;|''V''| nodes and ''m''&nbsp;=&nbsp;|''E''| edges. ...

A '''set intersection oracle (SIO)''' is a [[data structure]] which represents a collection of sets and can quickly answer qu ...re at most <math>\sqrt{N}</math> such sets. Create a table of intersection data between every large set to every other large set. This requires <math>O(N)< ...

{{Short description|Abstract data type in computer science}} ...notone priority queue''' is a variant of the [[priority queue]] [[abstract data type]] in which the priorities of extracted items are required to form a [[ ...

...[[parallel computation]] of solutions to common problems in [[algorithmic graph theory]]. It was introduced by Tarjan and Vishkin in 1984.<ref name="Tarjan ...ite conference | doi = 10.1145/225058.225269| chapter = Randomized dynamic graph algorithms with polylogarithmic time per operation| title = Proceedings of ...

{{Short description|Abstraction of graph shortest cycles}} ...cle in a graph, the edge connectivity of a graph, Hall sets in [[bipartite graph]]s, even sets in families of sets, and general position of point sets. It i ...

...ssful in multiple applications, for instance in learning sequence and tree structures in [[natural language processing]] (mainly continuous representations of ph ...s|first6=Leonadis|title=GRASS: Generative Recursive Autoencoders for Shape Structures|journal=ACM Transactions on Graphics|year=2017|url=https://www2.cs.sfu.ca/~ ...

{{Short description|Abstract simplicial complex describing a graph's cliques}} [[File:VR complex.svg|thumb|300px|The clique complex of a graph. Cliques of size one are shown as small red disks; cliques of size two are ...

{{Short description|Graph theory representation}} ...s of the [[complete graph]] ''K''₅ and the [[complete bipartite graph]] ''K''_3,4]] ...

{{Short description|Graph with oriented edges}} [[File:Directed graph no background.svg|upright|thumb|A simple directed graph]] ...

{{about|a technique in the design of graph algorithms|the use of color to display information|color code||Color code ( ...graph theory)|simple path]] of length {{mvar|k}} in a given [[graph theory|graph]]. The traditional color-coding algorithm is [[probabilistic algorithms|pro ...

Paul Dietz first introduced a data structure to solve this problem in }}.</ref> This data ...