• Thumbnail for Implicit graph
    In the study of graph algorithms, an implicit graph representation (or more simply implicit graph) is a graph whose vertices or edges are not represented...
    23 KB (2,839 words) - 17:41, 20 March 2025
  • equations is locally the graph of a function. Augustin-Louis Cauchy (1789–1857) is credited with the first rigorous form of the implicit function theorem. Ulisse...
    22 KB (3,732 words) - 22:20, 24 April 2025
  • Thumbnail for Reachability problem
    a graph of implicit states, which is of exponential size in the size of the description. In symbolic model checking, the model (the underlying graph) is...
    8 KB (887 words) - 00:29, 12 May 2025
  • on graphs can be translated to words representing them and solved on words (efficiently)? The implicit graph conjecture on the existence of implicit representations...
    195 KB (20,026 words) - 13:12, 7 May 2025
  • refer to the implicit solution y = f(x) involving the multi-valued implicit function f. Not every equation R(x, y) = 0 implies a graph of a single-valued...
    17 KB (2,204 words) - 03:08, 20 April 2025
  • configurations in this graph is O ( 2 f ( n ) ) {\displaystyle O(2^{f(n)})} , from which it follows that applying the algorithm to this implicit graph uses space...
    8 KB (1,094 words) - 01:59, 10 March 2025
  • Thumbnail for Complement graph
    studied algorithms that perform standard graph computations on the complement of an input graph, using an implicit graph representation that does not require...
    9 KB (1,125 words) - 22:13, 23 June 2023
  • Thumbnail for Knowledge graph
    retrieving implicit knowledge rather than only allowing queries requesting explicit knowledge. In order to allow the use of knowledge graphs in various...
    21 KB (2,342 words) - 00:05, 28 March 2025
  • Graph neural networks (GNN) are specialized artificial neural networks that are designed for tasks whose inputs are graphs. One prominent example is molecular...
    42 KB (4,593 words) - 06:37, 19 May 2025
  • Thumbnail for Depth-first search
    Depth-first search (category Graph algorithms)
    tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores...
    20 KB (2,447 words) - 19:40, 14 May 2025
  • In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether...
    20 KB (2,453 words) - 03:31, 18 May 2025
  • Thumbnail for Graph of a function
    In mathematics, the graph of a function f {\displaystyle f} is the set of ordered pairs ( x , y ) {\displaystyle (x,y)} , where f ( x ) = y . {\displaystyle...
    7 KB (961 words) - 07:13, 5 March 2025
  • Thumbnail for 15 puzzle
    1016/S0747-7171(08)80001-6. Richard E. Korf, Linear-time disk-based implicit graph search, Journal of the ACM Volume 55 Issue 6 (December 2008), Article...
    17 KB (2,072 words) - 19:34, 11 May 2025
  • Thumbnail for Black box group
    group is equipped with a further oracle for determining element orders. Implicit graph Matroid oracle Babai, L.; Szemeredi, E. (1984). "On the Complexity of...
    4 KB (437 words) - 10:39, 20 August 2024
  • Thumbnail for Existential graph
    An existential graph is a type of diagrammatic or visual notation for logical expressions, created by Charles Sanders Peirce, who wrote on graphical logic...
    23 KB (2,957 words) - 20:29, 19 October 2024
  • Thumbnail for Breadth-first search
    Breadth-first search (category Graph algorithms)
    the application of graph traversal methods in artificial intelligence the input may be an implicit representation of an infinite graph. In this context...
    14 KB (1,858 words) - 23:55, 2 April 2025
  • connection with the study of graph algorithms for graphs defined in an implicit graph model, where an algorithm has access to the graph only through a subroutine...
    5 KB (768 words) - 08:32, 25 February 2024
  • is uniquely represented by the set of all pairs (x, f (x)), called the graph of the function, a popular means of illustrating the function. When the...
    76 KB (11,411 words) - 13:49, 24 April 2025
  • graph-based data structures are used in computer science and related fields: Graph Adjacency list Adjacency matrix Graph-structured stack Scene graph...
    9 KB (914 words) - 05:55, 20 March 2025
  • GQL (Graph Query Language) is a standardized query language for property graphs first described in ISO/IEC 39075, released in April 2024 by ISO/IEC. The...
    37 KB (4,272 words) - 10:42, 5 January 2025
  • Thumbnail for Implicit curve
    coordinates) by any of three methods, one of which is the implicit equation given above. The graph of a function is usually described by an equation y = f...
    17 KB (3,430 words) - 09:06, 2 August 2024
  • Thumbnail for Handshaking lemma
    Handshaking lemma (category Lemmas in graph theory)
    large implicitly-defined graph. An undirected graph consists of a system of vertices, and edges connecting unordered pairs of vertices. In any graph, the...
    29 KB (3,598 words) - 02:01, 24 April 2025
  • Thumbnail for Surface (mathematics)
    the graph of a continuous function of two variables. The set of the zeros of a function of three variables is a surface, which is called an implicit surface...
    22 KB (3,964 words) - 11:53, 28 March 2025
  • semantic graph (ASG) or term graph is a form of abstract syntax in which an expression of a formal or programming language is represented by a graph whose...
    7 KB (872 words) - 18:53, 26 December 2024
  • is implicitly assumed to be finite unless stated otherwise. A graph dynamical system is constructed from the following components: A finite graph Y with...
    10 KB (1,387 words) - 02:38, 26 December 2024
  • instance D L {\displaystyle D_{L}} has the structure of an implicit graph (also called Transition graph ), the vertices being the solutions with two solutions...
    35 KB (5,471 words) - 04:13, 30 March 2025
  • Thumbnail for Implicit surface
    zeros of a function of three variables. Implicit means that the equation is not solved for x or y or z. The graph of a function is usually described by...
    14 KB (2,423 words) - 08:30, 9 February 2025
  • "the dependency graph of packages or components should have no cycles". This implies that the dependencies form a directed acyclic graph. In this UML package...
    3 KB (275 words) - 10:25, 1 August 2023
  • Thumbnail for Apache Spark
    Apache Spark (redirect from GraphX)
    processing. Spark provides an interface for programming clusters with implicit data parallelism and fault tolerance. Originally developed at the University...
    30 KB (2,752 words) - 16:06, 2 March 2025
  • Thumbnail for Critical point (mathematics)
    y-axis, and that, at this point, g does not define an implicit function from x to y (see implicit function theorem). If (x0, y0) is such a critical point...
    20 KB (2,989 words) - 15:42, 18 May 2025