<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/concept/tag/graph"><title>BibSonomy bookmarks for /concept/tag/graph</title><link>https://www.bibsonomy.org/concept/tag/graph</link><description>BibSonomy RSS Feed for /concept/tag/graph</description><items><rdf:Seq><rdf:li rdf:resource="https://www.desmos.com/"/><rdf:li rdf:resource="https://reactflow.dev/"/><rdf:li rdf:resource="https://ermongroup.github.io/cs228-notes/"/><rdf:li rdf:resource="https://samuelvaiter.com/intro-to-gnn/"/><rdf:li rdf:resource="https://bookdown.org/chua/new_rasch_demo2/DIF.html"/><rdf:li rdf:resource="https://www.vldb.org/pvldb/vol15/p1173-fuchs.pdf"/><rdf:li rdf:resource="https://journal-submission.dagstuhl.de/TGDK/"/><rdf:li rdf:resource="https://medium.com/@vespinozag/16-network-visualization-tools-that-you-should-know-2c26957b707e"/><rdf:li rdf:resource="https://higherorderco.com/"/><rdf:li rdf:resource="https://inciteful.xyz/"/><rdf:li rdf:resource="https://research.google/blog/solving-the-minimum-cut-problem-for-undirected-graphs/"/><rdf:li rdf:resource="https://news.ycombinator.com/item?id=40064027"/><rdf:li rdf:resource="https://coredumped.dev/2024/02/23/cycles-all-way-down/"/><rdf:li rdf:resource="https://en.wikipedia.org/wiki/Cycle_detection#Floyd&#039;s_tortoise_and_hare"/><rdf:li rdf:resource="https://github.com/rlerdorf/pdep"/><rdf:li rdf:resource="https://gephi.org/gephi-lite/"/><rdf:li rdf:resource="https://graph-tool.skewed.de/"/><rdf:li rdf:resource="https://tgraph.info/index.html"/><rdf:li rdf:resource="https://tikz.dev/gd-usage-tikz"/><rdf:li rdf:resource="https://github.com/cozodb/cozo"/></rdf:Seq></items></channel><item rdf:about="https://www.desmos.com/"><title>Desmos | Beautiful free math.</title><description>Desmos Studio offers free graphing, scientific, 3d, and geometry calculators used globally. Access our tools, partner with us, or explore examples for inspiration.</description><link>https://www.desmos.com/</link><dc:creator>koka</dc:creator><dc:date>2026-06-13T00:23:41+02:00</dc:date><dc:subject>visualization maths tools graph useful </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Desmos Studio offers free graphing, scientific, 3d, and geometry calculators used globally. Access our tools, partner with us, or explore examples for inspiration.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/visualization"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/maths"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tools"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/useful"/></rdf:Bag></taxo:topics></item><item rdf:about="https://reactflow.dev/"><title>Node-Based UIs in React - React Flow</title><description></description><link>https://reactflow.dev/</link><dc:creator>jil</dc:creator><dc:date>2026-02-11T11:00:53+01:00</dc:date><dc:subject>node js react flow graph chart </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2026-02-11T11:00:53+01:00&#034; href=&#034;https://reactflow.dev/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://reactflow.dev/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/node"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/js"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/react"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/flow"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/chart"/></rdf:Bag></taxo:topics></item><item rdf:about="https://ermongroup.github.io/cs228-notes/"><title>CS228: Probabilistic Graphical Models notes</title><description>Lecture notes for Stanford class</description><link>https://ermongroup.github.io/cs228-notes/</link><dc:creator>abhishektcsrni</dc:creator><dc:date>2026-01-13T13:32:34+01:00</dc:date><dc:subject>stanford course graph </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Lecture notes for Stanford class&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stanford"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/></rdf:Bag></taxo:topics></item><item rdf:about="https://samuelvaiter.com/intro-to-gnn/"><title>What’s a Graph Neural Network?</title><description></description><link>https://samuelvaiter.com/intro-to-gnn/</link><dc:creator>analyst</dc:creator><dc:date>2025-01-15T20:09:20+01:00</dc:date><dc:subject>deep-learning gnn graph blog </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2025-01-15T20:09:20+01:00&#034; href=&#034;https://samuelvaiter.com/intro-to-gnn/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://samuelvaiter.com/intro-to-gnn/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/deep-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/gnn"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blog"/></rdf:Bag></taxo:topics></item><item rdf:about="https://bookdown.org/chua/new_rasch_demo2/DIF.html"><title>Chapter 8 Basics of Differential Item Functioning | Rasch Measurement Theory Analysis in R: Illustrations and Practical Guidance for Researchers and Practitioners</title><description></description><link>https://bookdown.org/chua/new_rasch_demo2/DIF.html</link><dc:creator>cmerino</dc:creator><dc:date>2024-11-26T19:38:47+01:00</dc:date><dc:subject>r procedures difference graph </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2024-11-26T19:38:47+01:00&#034; href=&#034;https://bookdown.org/chua/new_rasch_demo2/DIF.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://bookdown.org/chua/new_rasch_demo2/DIF.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/r"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/procedures"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/difference"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.vldb.org/pvldb/vol15/p1173-fuchs.pdf"><title>p1173-fuchs.pdf</title><description></description><link>https://www.vldb.org/pvldb/vol15/p1173-fuchs.pdf</link><dc:creator>bshanks</dc:creator><dc:date>2024-11-03T00:37:30+01:00</dc:date><dc:subject>graph algorithm cs </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2024-11-03T00:37:30+01:00&#034; href=&#034;https://www.vldb.org/pvldb/vol15/p1173-fuchs.pdf&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.vldb.org/pvldb/vol15/p1173-fuchs.pdf&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/></rdf:Bag></taxo:topics></item><item rdf:about="https://journal-submission.dagstuhl.de/TGDK/"><title>Transactions on Graph Data and Knowledge</title><description></description><link>https://journal-submission.dagstuhl.de/TGDK/</link><dc:creator>hotho</dc:creator><dc:date>2024-10-04T18:10:30+02:00</dc:date><dc:subject>Janeway system jws knowledge submission transactions graph TGDK </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2024-10-04T18:10:30+02:00&#034; href=&#034;https://journal-submission.dagstuhl.de/TGDK/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://journal-submission.dagstuhl.de/TGDK/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Janeway"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/system"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/jws"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/knowledge"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/submission"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/transactions"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/TGDK"/></rdf:Bag></taxo:topics></item><item rdf:about="https://medium.com/@vespinozag/16-network-visualization-tools-that-you-should-know-2c26957b707e"><title>16 network visualization tools that you should know! | by Dr. Veronica Espinoza | Medium</title><description></description><link>https://medium.com/@vespinozag/16-network-visualization-tools-that-you-should-know-2c26957b707e</link><dc:creator>brightbyte</dc:creator><dc:date>2024-09-17T20:03:53+02:00</dc:date><dc:subject>visualization tools network graph </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2024-09-17T20:03:53+02:00&#034; href=&#034;https://medium.com/@vespinozag/16-network-visualization-tools-that-you-should-know-2c26957b707e&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://medium.com/@vespinozag/16-network-visualization-tools-that-you-should-know-2c26957b707e&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/visualization"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tools"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/></rdf:Bag></taxo:topics></item><item rdf:about="https://higherorderco.com/"><title>Higher Order Company</title><description></description><link>https://higherorderco.com/</link><dc:creator>jil</dc:creator><dc:date>2024-05-21T14:57:36+02:00</dc:date><dc:subject>code parallel language graph </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2024-05-21T14:57:36+02:00&#034; href=&#034;https://higherorderco.com/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://higherorderco.com/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/code"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/parallel"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/language"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/></rdf:Bag></taxo:topics></item><item rdf:about="https://inciteful.xyz/"><title>Using Citations to Explore Academic Literature | Inciteful.xyz</title><description>Using citations to find the most relevant literature</description><link>https://inciteful.xyz/</link><dc:creator>hotho</dc:creator><dc:date>2024-04-29T20:05:11+02:00</dc:date><dc:subject>literature paper citation network search graph scholar </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Using citations to find the most relevant literature&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/literature"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/paper"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/citation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/search"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/scholar"/></rdf:Bag></taxo:topics></item><item rdf:about="https://research.google/blog/solving-the-minimum-cut-problem-for-undirected-graphs/"><title>Solving the minimum cut problem for undirected graphs</title><description></description><link>https://research.google/blog/solving-the-minimum-cut-problem-for-undirected-graphs/</link><dc:creator>bshanks</dc:creator><dc:date>2024-04-17T20:24:35+02:00</dc:date><dc:subject>mincut graph algorithm </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2024-04-17T20:24:35+02:00&#034; href=&#034;https://research.google/blog/solving-the-minimum-cut-problem-for-undirected-graphs/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://research.google/blog/solving-the-minimum-cut-problem-for-undirected-graphs/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/mincut"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithm"/></rdf:Bag></taxo:topics></item><item rdf:about="https://news.ycombinator.com/item?id=40064027"><title>Solving the minimum cut problem for undirected graphs | Hacker News</title><description></description><link>https://news.ycombinator.com/item?id=40064027</link><dc:creator>bshanks</dc:creator><dc:date>2024-04-17T20:24:27+02:00</dc:date><dc:subject>mincut graph algorithm </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2024-04-17T20:24:27+02:00&#034; href=&#034;https://news.ycombinator.com/item?id=40064027&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://news.ycombinator.com/item?id=40064027&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/mincut"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithm"/></rdf:Bag></taxo:topics></item><item rdf:about="https://coredumped.dev/2024/02/23/cycles-all-way-down/"><title>Cycles all way down • Core Dumped</title><description></description><link>https://coredumped.dev/2024/02/23/cycles-all-way-down/</link><dc:creator>bshanks</dc:creator><dc:date>2024-02-24T17:27:59+01:00</dc:date><dc:subject>emacs graph cycle </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2024-02-24T17:27:59+01:00&#034; href=&#034;https://coredumped.dev/2024/02/23/cycles-all-way-down/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://coredumped.dev/2024/02/23/cycles-all-way-down/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/emacs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cycle"/></rdf:Bag></taxo:topics></item><item rdf:about="https://en.wikipedia.org/wiki/Cycle_detection#Floyd&#039;s_tortoise_and_hare"><title>Cycle detection - Wikipedia</title><description></description><link>https://en.wikipedia.org/wiki/Cycle_detection#Floyd&#039;s_tortoise_and_hare</link><dc:creator>bshanks</dc:creator><dc:date>2024-02-24T17:26:13+01:00</dc:date><dc:subject>graph cycle </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2024-02-24T17:26:13+01:00&#034; href=&#034;https://en.wikipedia.org/wiki/Cycle_detection#Floyd&amp;#039;s_tortoise_and_hare&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://en.wikipedia.org/wiki/Cycle_detection#Floyd&amp;#039;s_tortoise_and_hare&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cycle"/></rdf:Bag></taxo:topics></item><item rdf:about="https://github.com/rlerdorf/pdep"><title>rlerdorf/pdep: pdep frontend to Phan&#039;s DependencyGraphPlugin</title><description></description><link>https://github.com/rlerdorf/pdep</link><dc:creator>brightbyte</dc:creator><dc:date>2023-10-31T21:11:42+01:00</dc:date><dc:subject>phan call dependency plugin php pdep graph </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2023-10-31T21:11:42+01:00&#034; href=&#034;https://github.com/rlerdorf/pdep&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://github.com/rlerdorf/pdep&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/phan"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/call"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/dependency"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/plugin"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/php"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pdep"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/></rdf:Bag></taxo:topics></item><item rdf:about="https://gephi.org/gephi-lite/"><title>Gephi Lite</title><description></description><link>https://gephi.org/gephi-lite/</link><dc:creator>bshanks</dc:creator><dc:date>2023-04-09T02:06:50+02:00</dc:date><dc:subject>network graph </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2023-04-09T02:06:50+02:00&#034; href=&#034;https://gephi.org/gephi-lite/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://gephi.org/gephi-lite/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/></rdf:Bag></taxo:topics></item><item rdf:about="https://graph-tool.skewed.de/"><title>graph-tool: Efficent network analysis with python</title><description></description><link>https://graph-tool.skewed.de/</link><dc:creator>avs</dc:creator><dc:date>2023-02-28T17:31:28+01:00</dc:date><dc:subject>Graph Python Netzwerke </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2023-02-28T17:31:28+01:00&#034; href=&#034;https://graph-tool.skewed.de/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://graph-tool.skewed.de/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Python"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Netzwerke"/></rdf:Bag></taxo:topics></item><item rdf:about="https://tgraph.info/index.html"><title>TGRAPH: Transactions on Graph Data and Knowledge</title><description></description><link>https://tgraph.info/index.html</link><dc:creator>hotho</dc:creator><dc:date>2023-02-12T16:36:58+01:00</dc:date><dc:subject>journal semantics tgraph KG knowledge graph </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2023-02-12T16:36:58+01:00&#034; href=&#034;https://tgraph.info/index.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://tgraph.info/index.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/journal"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/semantics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tgraph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/KG"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/knowledge"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/></rdf:Bag></taxo:topics></item><item rdf:about="https://tikz.dev/gd-usage-tikz"><title>Using Graph Drawing in TikZ - PGF/TikZ Manual</title><description></description><link>https://tikz.dev/gd-usage-tikz</link><dc:creator>avs</dc:creator><dc:date>2022-12-20T14:24:26+01:00</dc:date><dc:subject>Graph TeXLaTeX </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2022-12-20T14:24:26+01:00&#034; href=&#034;https://tikz.dev/gd-usage-tikz&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://tikz.dev/gd-usage-tikz&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/TeXLaTeX"/></rdf:Bag></taxo:topics></item><item rdf:about="https://github.com/cozodb/cozo"><title>GitHub - cozodb/cozo: A general-purpose, transactional, relational database that uses Datalog and focuses on graph data and algorithms</title><description></description><link>https://github.com/cozodb/cozo</link><dc:creator>bshanks</dc:creator><dc:date>2022-11-18T00:23:02+01:00</dc:date><dc:subject>datalog db graph </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2022-11-18T00:23:02+01:00&#034; href=&#034;https://github.com/cozodb/cozo&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://github.com/cozodb/cozo&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/datalog"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/db"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/></rdf:Bag></taxo:topics></item></rdf:RDF>