<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Network Graph on Kinetica Docs</title><link>/7.1/graph_solver/</link><description>Recent content in Network Graph on Kinetica Docs</description><generator>Hugo -- gohugo.io</generator><language>en</language><atom:link href="/7.1/graph_solver/index.xml" rel="self" type="application/rss+xml"/><item><title>Distributed Graph Servers</title><link>/7.1/graph_solver/distributed_graph_server/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>/7.1/graph_solver/distributed_graph_server/</guid><description>In Kinetica versions 7.1.2 and greater, distributed graph servers are able to be initialized during the installation process. If distributed graph servers are enabled, the additional CPU power from distributed graph server hosts can be leveraged to make all types of graph operations more performant.
Installation &amp;amp; Configuration Leveraging Distributed Graph Servers Examples Distributed Graph Server User Interface (UI) Installation &amp;amp; Configuration As mentioned above, determining if a cluster should have distributed graph servers happens during the nodes configuration process of the installation process.</description></item><item><title>Network Graphs &amp; Solvers Concepts</title><link>/7.1/graph_solver/network_graph_solver/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>/7.1/graph_solver/network_graph_solver/</guid><description>Graphs in Kinetica A Brief Intro Graphs in Kinetica &amp;times; Kinetica provides a generic and extensible design of networks with the aim of being tailored or used for various real-life applications, such as transportation, utility, social, and geospatial. Networks comprise a graph and a solver. A graph represents topological relationships via nodes that are connected by edges; a solver represents the type of solution appropriate for the issue the graph was made to illustrate.</description></item></channel></rss>