Joseph A di PaolantonioVaibhav Gupta and the team of Boundary, with Amy Hodler, are hosting GraphCon at the Boundary offices in Seattle. Lightning talks and reverse hackathon on the toughest real world problems that participants bring and vote to solve, are the highlights of this Graph Community event.
Sebastian ForsterThis somehow sounds too good to be true: "Attractors Is All You Need: Parity Games In Polynomial Time" (https://arxiv.org/abs/2511.03752)
I had a quick look, but I don't remember the typical strategies of algorithms for parity games anymore. Any opinions?
Attractors Is All You Need: Parity Games In Polynomial Time
This paper provides a polynomial-time algorithm for solving parity games that runs in $\mathcal{O}(n^{2}\cdot(n + m))$ time-ending a search that has taken decades. Unlike previous attractor-based algorithms, the presented algorithm only removes regions with a determined winner. The paper introduces a new type of attractor that can guarantee finding the minimal dominion of a parity game. The attractor runs in polynomial time and can peel the graph empty.
Hacker NewsIterative DFS with stack-based graph traversal (2024)
https://dwf.dev/blog/2024/09/23/2024/dfs-iterative-stack-based
#HackerNews #IterativeDFS #StackTraversal #GraphAlgorithms #DepthFirstSearch #2024Trends
Saulo Popov ZambiasiTrying to tame the NP-complete beast — writing a paper about my algorithm for solving the Hamiltonian cycle #graphs #hamiltoncycle #npcomplete #graphalgorithms #computerscience #heuristics #optimization #research #computationalcomplexity #hacking #latex
Saulo Popov ZambiasiTrying to tame the NP-complete beast — writing a paper about my algorithm for solving the Hamiltonian cycle #graphs #hamiltoncycle #npcomplete #graphalgorithms #computerscience #heuristics #optimization #research #computationalcomplexity #hacking
zartomEfficiently Creating and Visualizing Symmetric Adjacency Matrices in Python
Master Python Adjacency Matrix techniques! Learn efficient creation, NetworkX visualization, & handling of large datasets. Represent & analyze complex relationships in your data. #PythonAdjacencyMatrix #GraphTheory #NetworkX #DataVisualization #DataScience #GraphAlgorithms
https://tech-champion.com/programming/python-programming/efficiently-creating-and-visualizing-symmetric-adjacency-matrices-in-python/
Master Python Adjacency Matrix techniques! Learn efficient creation, NetworkX visualization, & handling of large datasets. Represent & analyze complex relationships in your data. #PythonAdjacencyMatrix #GraphTheory #NetworkX #DataVisualization #DataScience #GraphAlgorithms
https://tech-champion.com/programming/python-programming/efficiently-creating-and-visualizing-symmetric-adjacency-matrices-in-python/
Kingsley Uyi Idehen
Pushkarprabhat SaxenaThe Role of Graph Algorithms in Drug Discovery for Cardiovascular Disease
Drug discovery is a time-consuming and costly process, especially for cardiovascular diseases (CVD). Graph algorithms are revolutionizing this space by mapping complex interactions between biological systems and drug compounds. This helps researchers identify promising drug candidates faster, reducing time-to-market and enabling personalized treatment strategies.
