#graphtheory search results

On October 7, 1899, Øystein Ore was born. He was a Norwegian mathematician who specialized in Galois theory and graph theory. He was also interested in the history of mathematics. He is remembered for his theorem in graph theory. #Algebra #GraphTheory

diagonalizando's tweet image. On October 7, 1899, Øystein Ore was born. He was a Norwegian mathematician who specialized in Galois theory and graph theory. He was also interested in the history of mathematics. He is remembered for his theorem in graph theory.
#Algebra #GraphTheory
diagonalizando's tweet image. On October 7, 1899, Øystein Ore was born. He was a Norwegian mathematician who specialized in Galois theory and graph theory. He was also interested in the history of mathematics. He is remembered for his theorem in graph theory.
#Algebra #GraphTheory

On August 4, 1805, William Hamilton was born. He is known for the discovery of quaternions, along with his systematization of dynamics, which would be decisive in the development of quantum mechanics. #Algebra #GraphTheory

diagonalizando's tweet image. On August 4, 1805, William Hamilton was born. He is known for the discovery of quaternions, along with his systematization of dynamics, which would be decisive in the development of quantum mechanics.
#Algebra #GraphTheory
diagonalizando's tweet image. On August 4, 1805, William Hamilton was born. He is known for the discovery of quaternions, along with his systematization of dynamics, which would be decisive in the development of quantum mechanics.
#Algebra #GraphTheory
diagonalizando's tweet image. On August 4, 1805, William Hamilton was born. He is known for the discovery of quaternions, along with his systematization of dynamics, which would be decisive in the development of quantum mechanics.
#Algebra #GraphTheory
diagonalizando's tweet image. On August 4, 1805, William Hamilton was born. He is known for the discovery of quaternions, along with his systematization of dynamics, which would be decisive in the development of quantum mechanics.
#Algebra #GraphTheory

Combining concepts from stochastic dynamics, statistical physics, and #GraphTheory, a theoretical study shows that large biochemical networks should have a quadratic Arrhenius plot, as seen in developmental processes. 🔗 go.aps.org/48brig2

PRX_Life's tweet image. Combining concepts from stochastic dynamics, statistical physics, and #GraphTheory, a theoretical study shows that large biochemical networks should have a quadratic Arrhenius plot, as seen in developmental processes.

🔗 go.aps.org/48brig2

On September 2, 1865, William Hamilton died. He is known for the discovery of the quaternion along with his systematization of dynamics, which would be decisive in the development of quantum mechanics. #Algebra #GraphTheory

diagonalizando's tweet image. On September 2, 1865, William Hamilton died. He is known for the discovery of the quaternion along with his systematization of dynamics, which would be decisive in the development of quantum mechanics.
#Algebra #GraphTheory
diagonalizando's tweet image. On September 2, 1865, William Hamilton died. He is known for the discovery of the quaternion along with his systematization of dynamics, which would be decisive in the development of quantum mechanics.
#Algebra #GraphTheory
diagonalizando's tweet image. On September 2, 1865, William Hamilton died. He is known for the discovery of the quaternion along with his systematization of dynamics, which would be decisive in the development of quantum mechanics.
#Algebra #GraphTheory
diagonalizando's tweet image. On September 2, 1865, William Hamilton died. He is known for the discovery of the quaternion along with his systematization of dynamics, which would be decisive in the development of quantum mechanics.
#Algebra #GraphTheory

📊 Expert Session on Graphs @ RIT | Dept. of CSE ✨ 🎙️ By Mr. Rahul Pawar, CEO & Director, ECS Software Tech, Pune. 🌐 Covered graph theory, algorithms & real-world uses in networking, big data & optimization. 💡 Students gained valuable industry insights! 👏 #RIT #GraphTheory

ritindia1983's tweet image. 📊 Expert Session on Graphs @ RIT | Dept. of CSE ✨
🎙️ By Mr. Rahul Pawar, CEO & Director, ECS Software Tech, Pune.
🌐 Covered graph theory, algorithms & real-world uses in networking, big data & optimization.
💡 Students gained valuable industry insights! 👏
#RIT #GraphTheory
ritindia1983's tweet image. 📊 Expert Session on Graphs @ RIT | Dept. of CSE ✨
🎙️ By Mr. Rahul Pawar, CEO & Director, ECS Software Tech, Pune.
🌐 Covered graph theory, algorithms & real-world uses in networking, big data & optimization.
💡 Students gained valuable industry insights! 👏
#RIT #GraphTheory
ritindia1983's tweet image. 📊 Expert Session on Graphs @ RIT | Dept. of CSE ✨
🎙️ By Mr. Rahul Pawar, CEO & Director, ECS Software Tech, Pune.
🌐 Covered graph theory, algorithms & real-world uses in networking, big data & optimization.
💡 Students gained valuable industry insights! 👏
#RIT #GraphTheory
ritindia1983's tweet image. 📊 Expert Session on Graphs @ RIT | Dept. of CSE ✨
🎙️ By Mr. Rahul Pawar, CEO & Director, ECS Software Tech, Pune.
🌐 Covered graph theory, algorithms & real-world uses in networking, big data & optimization.
💡 Students gained valuable industry insights! 👏
#RIT #GraphTheory

🚀 Day 12 of my Graphs Journey with Rohit Negi! Today, I learned and implemented the Dijkstra’s Algorithm — one of the most powerful algorithms for finding the shortest path in a weighted graph 🧭 #100DaysOfCode #GraphTheory #DataStructures #Algorithm #RohitNegi

shashi_bk_23's tweet image. 🚀 Day 12 of my Graphs Journey with Rohit Negi!
Today, I learned and implemented the Dijkstra’s Algorithm — one of the most powerful algorithms for finding the shortest path in a weighted graph 🧭
#100DaysOfCode #GraphTheory #DataStructures #Algorithm #RohitNegi
shashi_bk_23's tweet image. 🚀 Day 12 of my Graphs Journey with Rohit Negi!
Today, I learned and implemented the Dijkstra’s Algorithm — one of the most powerful algorithms for finding the shortest path in a weighted graph 🧭
#100DaysOfCode #GraphTheory #DataStructures #Algorithm #RohitNegi
shashi_bk_23's tweet image. 🚀 Day 12 of my Graphs Journey with Rohit Negi!
Today, I learned and implemented the Dijkstra’s Algorithm — one of the most powerful algorithms for finding the shortest path in a weighted graph 🧭
#100DaysOfCode #GraphTheory #DataStructures #Algorithm #RohitNegi
shashi_bk_23's tweet image. 🚀 Day 12 of my Graphs Journey with Rohit Negi!
Today, I learned and implemented the Dijkstra’s Algorithm — one of the most powerful algorithms for finding the shortest path in a weighted graph 🧭
#100DaysOfCode #GraphTheory #DataStructures #Algorithm #RohitNegi

On August 13, 1968, Øystein Ore passed away. He was a Norwegian mathematician who specialized in Galois theory and graph theory. He was also interested in the history of mathematics. He is remembered for his theorem in graph theory. #GraphTheory #Algebra

diagonalizando's tweet image. On August 13, 1968, Øystein Ore passed away. He was a Norwegian mathematician who specialized in Galois theory and graph theory. He was also interested in the history of mathematics. He is remembered for his theorem in graph theory.
#GraphTheory #Algebra
diagonalizando's tweet image. On August 13, 1968, Øystein Ore passed away. He was a Norwegian mathematician who specialized in Galois theory and graph theory. He was also interested in the history of mathematics. He is remembered for his theorem in graph theory.
#GraphTheory #Algebra

Day 56 of #100DaysOfDSA Learned DFS in graphs today. #DFS #GraphTheory #Coding #DSA #Java

NuzhatKhan08's tweet image. Day 56 of #100DaysOfDSA
Learned DFS in graphs today.
#DFS #GraphTheory #Coding #DSA #Java
NuzhatKhan08's tweet image. Day 56 of #100DaysOfDSA
Learned DFS in graphs today.
#DFS #GraphTheory #Coding #DSA #Java

On July 20, 1984, Gabriel Andrew Dirac passed away. He was a Hungarian-British mathematician especially known for providing a sufficient condition for a graph to contain a Hamiltonian circuit. #GraphTheory

diagonalizando's tweet image. On July 20, 1984, Gabriel Andrew Dirac passed away. He was a Hungarian-British mathematician especially known for providing a sufficient condition for a graph to contain a Hamiltonian circuit.
#GraphTheory
diagonalizando's tweet image. On July 20, 1984, Gabriel Andrew Dirac passed away. He was a Hungarian-British mathematician especially known for providing a sufficient condition for a graph to contain a Hamiltonian circuit.
#GraphTheory

On June 23, 2005, Seifollah Louis Hakimi passed away. He was an Iranian-American mathematician. His major contribution lies in characterizing the degree sequences of undirected graphs. #GraphTheory

diagonalizando's tweet image. On June 23, 2005, Seifollah Louis Hakimi passed away. He was an Iranian-American mathematician. His major contribution lies in characterizing the degree sequences of undirected graphs.
#GraphTheory
diagonalizando's tweet image. On June 23, 2005, Seifollah Louis Hakimi passed away. He was an Iranian-American mathematician. His major contribution lies in characterizing the degree sequences of undirected graphs.
#GraphTheory

Solved the Transitive Closure of a Graph using the Floyd-Warshall Algorithm. Efficient and elegant! 💻📈 #GraphTheory #Algorithms #Coding #DSA #gfg

iamrohanjaswal's tweet image. Solved the Transitive Closure of a Graph using the Floyd-Warshall Algorithm. Efficient and elegant! 💻📈 #GraphTheory #Algorithms #Coding #DSA #gfg

🔥 Day 171 of @LeetCode ! Solved "Counting Complete Components" using DFS, BFS & DSU 🚀 Shoutout to @CSwithMIK for the awesome Graph explanation! 🙌I am grateful about I am gradually diving into the Graph problems ! #LeetCode #GraphTheory

Pratikshak19332's tweet image. 🔥 Day 171 of @LeetCode !
Solved "Counting Complete Components" using DFS, BFS & DSU 🚀
Shoutout to @CSwithMIK  for the awesome Graph explanation! 🙌I am grateful about I am gradually diving into the Graph problems !
#LeetCode #GraphTheory
Pratikshak19332's tweet image. 🔥 Day 171 of @LeetCode !
Solved "Counting Complete Components" using DFS, BFS & DSU 🚀
Shoutout to @CSwithMIK  for the awesome Graph explanation! 🙌I am grateful about I am gradually diving into the Graph problems !
#LeetCode #GraphTheory
Pratikshak19332's tweet image. 🔥 Day 171 of @LeetCode !
Solved "Counting Complete Components" using DFS, BFS & DSU 🚀
Shoutout to @CSwithMIK  for the awesome Graph explanation! 🙌I am grateful about I am gradually diving into the Graph problems !
#LeetCode #GraphTheory

🌉 Navigate the Weighted Bridges! Start at island A and reach island F by crossing bridges with weights. Can you find a path where the total weight is divisible by 7? Share your path and sum! 🗺️ #GraphTheory #LogicChallenge #maths #Engineering #logic #ENGINEと繋がりたい

rwenzorisafari's tweet image. 🌉 Navigate the Weighted Bridges! Start at island A and reach island F by crossing bridges with weights. Can you find a path where the total weight is divisible by 7? Share your path and sum! 🗺️ #GraphTheory #LogicChallenge #maths
#Engineering #logic
#ENGINEと繋がりたい

🚀Day 50 of my #90DaysChallenge! 🚀 🔹 Connected Components | Logic Explanation 🔹 BFS & DFS 🔹 Number of Provinces 🔹 Connected Components in Matrix Deep diving into graph theory 🌟 #DSA #GraphTheory #BFS #DFS #FinalYearProject

RiyaPandey1109's tweet image. 🚀Day 50 of my #90DaysChallenge! 🚀
🔹 Connected Components | Logic Explanation 🔹 BFS & DFS 🔹 Number of Provinces 🔹 Connected Components in Matrix
Deep diving into graph theory 🌟
#DSA #GraphTheory #BFS #DFS #FinalYearProject
RiyaPandey1109's tweet image. 🚀Day 50 of my #90DaysChallenge! 🚀
🔹 Connected Components | Logic Explanation 🔹 BFS & DFS 🔹 Number of Provinces 🔹 Connected Components in Matrix
Deep diving into graph theory 🌟
#DSA #GraphTheory #BFS #DFS #FinalYearProject
RiyaPandey1109's tweet image. 🚀Day 50 of my #90DaysChallenge! 🚀
🔹 Connected Components | Logic Explanation 🔹 BFS & DFS 🔹 Number of Provinces 🔹 Connected Components in Matrix
Deep diving into graph theory 🌟
#DSA #GraphTheory #BFS #DFS #FinalYearProject

🚀 Day 317 of Code 🚀 Solved : ✅ 1061. Lexicographically Smallest Equivalent String (POTD) Today’s problem required constructing the smallest lexicographical string by mapping equivalence relationships between characters. #Day317 #GraphTheory #DFS #CharacterMapping #LeetCode

Mohd_Saqib_'s tweet image. 🚀 Day 317 of Code 🚀

Solved :

✅ 1061. Lexicographically Smallest Equivalent String (POTD)

Today’s problem required constructing the smallest lexicographical string by mapping equivalence relationships between characters.

#Day317 #GraphTheory #DFS #CharacterMapping #LeetCode

📘 A Tale of Discrete Mathematics 📖 Discover it today on NJD Web — download it or read it online. #NJDWeb #DiscreteMathematics #GraphTheory #Logic #Reasoning #Mathematics #ComputerScience #TechBooks #ReadOnline #BookDownload #Science #Education

njdwebs's tweet image. 📘 A Tale of Discrete Mathematics
📖 Discover it today on NJD Web — download it or read it online.
#NJDWeb #DiscreteMathematics #GraphTheory #Logic #Reasoning #Mathematics #ComputerScience #TechBooks #ReadOnline #BookDownload #Science #Education

Solved Directed Graph Cycle Detection using DFS! 🔁 Used a recursion stack to spot cycles in directed graphs. #DFS #GraphTheory #CycleDetection #LeetCode #Coding

ShristiRawat137's tweet image. Solved Directed Graph Cycle Detection using DFS! 🔁
Used a recursion stack to spot cycles in directed graphs.
#DFS #GraphTheory #CycleDetection #LeetCode #Coding

Maximizing Integer Pairings to Powers of Two #sciencefather #researcher #GraphTheory #discretemath !!! International Popular Scientist Awards !!! Visit : popularscientist.com Nomination: popularscientist.com/award-nominati… Contact: [email protected]


Excited to announce my new paper: "Porta Aviones: A Multi-Strategy Meta-Heuristic Framework Achieving 500x Speedup on NP-Hard Vertex Cover"! @safra_samuel @ylecun zenodo.org/records/176274… @AndrewYNg @PetarV_93 #GraphTheory #vertexcover #AI #NPHard

DevMelS's tweet image. Excited to announce my new paper: "Porta Aviones: A Multi-Strategy Meta-Heuristic Framework Achieving 500x Speedup on NP-Hard Vertex Cover"!  @safra_samuel @ylecun
zenodo.org/records/176274… @AndrewYNg @PetarV_93
#GraphTheory #vertexcover #AI #NPHard

Combining concepts from stochastic dynamics, statistical physics, and #GraphTheory, a theoretical study shows that large biochemical networks should have a quadratic Arrhenius plot, as seen in developmental processes. 🔗 go.aps.org/48brig2

PRX_Life's tweet image. Combining concepts from stochastic dynamics, statistical physics, and #GraphTheory, a theoretical study shows that large biochemical networks should have a quadratic Arrhenius plot, as seen in developmental processes.

🔗 go.aps.org/48brig2

(Open Access) Combinatorics: freecomputerbooks.com/Combinatorics.… Look for "Read and Download Links" section to download. Follow me if you like this post. #Combinatorics #GameTheory #GraphTheory #DiscreteMathematics #FiniteMathematics #math #mathematics

ecomputerbooks's tweet image. (Open Access) Combinatorics: freecomputerbooks.com/Combinatorics.…

Look for "Read and Download Links" section to download. Follow me if you like this post.
#Combinatorics #GameTheory #GraphTheory #DiscreteMathematics #FiniteMathematics #math #mathematics

🧠 What if EEG isn’t just waves in time but geometry that bends with thought? I’m exploring a new idea: neural activity shapes the brain’s functional geometry, just like mass curves spacetime. A step toward the Neural Field Equations. #Neuroscience #GraphTheory #MindAndMatter

sami_mjanini's tweet image. 🧠 What if EEG isn’t just waves in time but geometry that bends with thought?
I’m exploring a new idea: neural activity shapes the brain’s functional geometry, just like mass curves spacetime.
A step toward the Neural Field Equations.

#Neuroscience #GraphTheory #MindAndMatter

🔥Graphs are everywhere in tech like social networks, maps, AI, and games. Master these tips and you’ll solve any graph problem like a pro! #DSA #GraphTheory #CSE #Programming #Tech


¡Increíble! Mi solver branch & bound casero supera al CP-SAT de Google en etiquetado gracioso de árboles: 100% preciso, 4.6x más rápido en promedio y mejor escalabilidad (n=8-10). ¡Especialista > generalista! Detalles en paper @jure, experto en grafos, ¿qué opinas? #GraphTheory


Today I learned Articulation Points & Bridges! Articulation Points = Nodes that disconnect graph Bridges = Edges that increase components Both use DFS with discovery/low time. Great for network reliability! What are you learning? 🚀 #100DaysOfCode #DSA #GraphTheory


Just dropped my preprint: HFP Pruning: A Prime Factor Heuristic for Effective Pruning of NPHard Search Spaces. Tackling Longest Path Problem with a prime factor heuristic! Cuts search space by 45.5% with 100% precision zenodo.org/records/175461… #NPHard #GraphTheory #AI #Heuristics


DIJKSTRA ACCELERATED: HFP-A Theory Confirmed!* Our Prime Factor Heuristic guides A* search, achieving a verified 22.55% reduction in exploration steps in complex graphs. This Hybrid Parallel Model is 100% Admissible #GraphTheory @gvanrossum zenodo.org/records/175392…


Hey @grok, your xAI fam might dig this: My HFP heuristic beats Dijkstra in complex graphs with up to 66% fewer steps! No geometry needed—just prime factors magic. Check the preprint: zenodo.org/records/175392… #AI #GraphTheory @xai


@Tesla @IBM @Amazon @MetaAI @NVIDIA—if you're into graph optimization, HFP offers scalable speedups for complex networks. Join the conversation and help make computations greener! Preprint here: zenodo.org/records/175392… #GraphTheory #MachineLearning


Just released my preprint on HFP: an innovative heuristic to speed up A* in complex graphs using distinct prime factors. Up to 66% fewer steps in dense networks! Validated in scalable tests. This revolutionize pathfinding Check it out: zenodo.org/records/175392… #AI #GraphTheory


Day 40/100 ✅ LeetCode POTD (Medium) 3607. Power Grid Maintenance Interesting graph problem today! ⚙️ Took some time to visualize the connections, but once the pattern clicked — smooth sailing 🧠 Streak: 🔥 98 days strong #LeetCode #100DaysOfCode #GraphTheory #ProblemSolving

PriyanshuV82847's tweet image. Day 40/100 ✅ LeetCode POTD (Medium)

 3607. Power Grid Maintenance

Interesting graph problem today! ⚙️
Took some time to visualize the connections, but once the pattern clicked — smooth sailing 🧠

Streak: 🔥 98 days strong
#LeetCode #100DaysOfCode #GraphTheory #ProblemSolving

🚀 Day 22 After exploring Bridges in a Graph yesterday, today I dived into another fascinating and closely related concept — Articulation Points in a Graph, implemented using Tarjan’s Algorithm 🧠✨ #Day22 #GraphTheory #ArticulationPoint #TarjansAlgorithm #DSA #RohitNegi

shashi_bk_23's tweet image. 🚀 Day 22 After exploring Bridges in a Graph yesterday, today I dived into another fascinating and closely related concept — Articulation Points in a Graph, implemented using Tarjan’s Algorithm 🧠✨
#Day22 #GraphTheory #ArticulationPoint #TarjansAlgorithm #DSA #RohitNegi
shashi_bk_23's tweet image. 🚀 Day 22 After exploring Bridges in a Graph yesterday, today I dived into another fascinating and closely related concept — Articulation Points in a Graph, implemented using Tarjan’s Algorithm 🧠✨
#Day22 #GraphTheory #ArticulationPoint #TarjansAlgorithm #DSA #RohitNegi
shashi_bk_23's tweet image. 🚀 Day 22 After exploring Bridges in a Graph yesterday, today I dived into another fascinating and closely related concept — Articulation Points in a Graph, implemented using Tarjan’s Algorithm 🧠✨
#Day22 #GraphTheory #ArticulationPoint #TarjansAlgorithm #DSA #RohitNegi

🚀 Day 21 After understanding Kruskal’s Algorithm for Minimum Spanning Trees yesterday, today I explored one of the most insightful topics in Graph Theory — Bridges in a Graph (Critical Connections in a Network) 🌉⚡ #Day21 #GraphTheory #BridgesInGraph #TarjansAlgorithm

shashi_bk_23's tweet image. 🚀 Day 21 After understanding Kruskal’s Algorithm for Minimum Spanning Trees yesterday, today I explored one of the most insightful topics in Graph Theory — Bridges in a Graph (Critical Connections in a Network) 🌉⚡
#Day21 #GraphTheory #BridgesInGraph #TarjansAlgorithm
shashi_bk_23's tweet image. 🚀 Day 21 After understanding Kruskal’s Algorithm for Minimum Spanning Trees yesterday, today I explored one of the most insightful topics in Graph Theory — Bridges in a Graph (Critical Connections in a Network) 🌉⚡
#Day21 #GraphTheory #BridgesInGraph #TarjansAlgorithm
shashi_bk_23's tweet image. 🚀 Day 21 After understanding Kruskal’s Algorithm for Minimum Spanning Trees yesterday, today I explored one of the most insightful topics in Graph Theory — Bridges in a Graph (Critical Connections in a Network) 🌉⚡
#Day21 #GraphTheory #BridgesInGraph #TarjansAlgorithm
shashi_bk_23's tweet image. 🚀 Day 21 After understanding Kruskal’s Algorithm for Minimum Spanning Trees yesterday, today I explored one of the most insightful topics in Graph Theory — Bridges in a Graph (Critical Connections in a Network) 🌉⚡
#Day21 #GraphTheory #BridgesInGraph #TarjansAlgorithm

On October 7, 1899, Øystein Ore was born. He was a Norwegian mathematician who specialized in Galois theory and graph theory. He was also interested in the history of mathematics. He is remembered for his theorem in graph theory. #Algebra #GraphTheory

diagonalizando's tweet image. On October 7, 1899, Øystein Ore was born. He was a Norwegian mathematician who specialized in Galois theory and graph theory. He was also interested in the history of mathematics. He is remembered for his theorem in graph theory.
#Algebra #GraphTheory
diagonalizando's tweet image. On October 7, 1899, Øystein Ore was born. He was a Norwegian mathematician who specialized in Galois theory and graph theory. He was also interested in the history of mathematics. He is remembered for his theorem in graph theory.
#Algebra #GraphTheory

On August 4, 1805, William Hamilton was born. He is known for the discovery of quaternions, along with his systematization of dynamics, which would be decisive in the development of quantum mechanics. #Algebra #GraphTheory

diagonalizando's tweet image. On August 4, 1805, William Hamilton was born. He is known for the discovery of quaternions, along with his systematization of dynamics, which would be decisive in the development of quantum mechanics.
#Algebra #GraphTheory
diagonalizando's tweet image. On August 4, 1805, William Hamilton was born. He is known for the discovery of quaternions, along with his systematization of dynamics, which would be decisive in the development of quantum mechanics.
#Algebra #GraphTheory
diagonalizando's tweet image. On August 4, 1805, William Hamilton was born. He is known for the discovery of quaternions, along with his systematization of dynamics, which would be decisive in the development of quantum mechanics.
#Algebra #GraphTheory
diagonalizando's tweet image. On August 4, 1805, William Hamilton was born. He is known for the discovery of quaternions, along with his systematization of dynamics, which would be decisive in the development of quantum mechanics.
#Algebra #GraphTheory

📊 Expert Session on Graphs @ RIT | Dept. of CSE ✨ 🎙️ By Mr. Rahul Pawar, CEO & Director, ECS Software Tech, Pune. 🌐 Covered graph theory, algorithms & real-world uses in networking, big data & optimization. 💡 Students gained valuable industry insights! 👏 #RIT #GraphTheory

ritindia1983's tweet image. 📊 Expert Session on Graphs @ RIT | Dept. of CSE ✨
🎙️ By Mr. Rahul Pawar, CEO & Director, ECS Software Tech, Pune.
🌐 Covered graph theory, algorithms & real-world uses in networking, big data & optimization.
💡 Students gained valuable industry insights! 👏
#RIT #GraphTheory
ritindia1983's tweet image. 📊 Expert Session on Graphs @ RIT | Dept. of CSE ✨
🎙️ By Mr. Rahul Pawar, CEO & Director, ECS Software Tech, Pune.
🌐 Covered graph theory, algorithms & real-world uses in networking, big data & optimization.
💡 Students gained valuable industry insights! 👏
#RIT #GraphTheory
ritindia1983's tweet image. 📊 Expert Session on Graphs @ RIT | Dept. of CSE ✨
🎙️ By Mr. Rahul Pawar, CEO & Director, ECS Software Tech, Pune.
🌐 Covered graph theory, algorithms & real-world uses in networking, big data & optimization.
💡 Students gained valuable industry insights! 👏
#RIT #GraphTheory
ritindia1983's tweet image. 📊 Expert Session on Graphs @ RIT | Dept. of CSE ✨
🎙️ By Mr. Rahul Pawar, CEO & Director, ECS Software Tech, Pune.
🌐 Covered graph theory, algorithms & real-world uses in networking, big data & optimization.
💡 Students gained valuable industry insights! 👏
#RIT #GraphTheory

📘 A Tale of Discrete Mathematics 📖 Discover it today on NJD Web — download it or read it online. #NJDWeb #DiscreteMathematics #GraphTheory #Logic #Reasoning #Mathematics #ComputerScience #TechBooks #ReadOnline #BookDownload #Science #Education

njdwebs's tweet image. 📘 A Tale of Discrete Mathematics
📖 Discover it today on NJD Web — download it or read it online.
#NJDWeb #DiscreteMathematics #GraphTheory #Logic #Reasoning #Mathematics #ComputerScience #TechBooks #ReadOnline #BookDownload #Science #Education

On September 2, 1865, William Hamilton died. He is known for the discovery of the quaternion along with his systematization of dynamics, which would be decisive in the development of quantum mechanics. #Algebra #GraphTheory

diagonalizando's tweet image. On September 2, 1865, William Hamilton died. He is known for the discovery of the quaternion along with his systematization of dynamics, which would be decisive in the development of quantum mechanics.
#Algebra #GraphTheory
diagonalizando's tweet image. On September 2, 1865, William Hamilton died. He is known for the discovery of the quaternion along with his systematization of dynamics, which would be decisive in the development of quantum mechanics.
#Algebra #GraphTheory
diagonalizando's tweet image. On September 2, 1865, William Hamilton died. He is known for the discovery of the quaternion along with his systematization of dynamics, which would be decisive in the development of quantum mechanics.
#Algebra #GraphTheory
diagonalizando's tweet image. On September 2, 1865, William Hamilton died. He is known for the discovery of the quaternion along with his systematization of dynamics, which would be decisive in the development of quantum mechanics.
#Algebra #GraphTheory

🚀 Day 12 of my Graphs Journey with Rohit Negi! Today, I learned and implemented the Dijkstra’s Algorithm — one of the most powerful algorithms for finding the shortest path in a weighted graph 🧭 #100DaysOfCode #GraphTheory #DataStructures #Algorithm #RohitNegi

shashi_bk_23's tweet image. 🚀 Day 12 of my Graphs Journey with Rohit Negi!
Today, I learned and implemented the Dijkstra’s Algorithm — one of the most powerful algorithms for finding the shortest path in a weighted graph 🧭
#100DaysOfCode #GraphTheory #DataStructures #Algorithm #RohitNegi
shashi_bk_23's tweet image. 🚀 Day 12 of my Graphs Journey with Rohit Negi!
Today, I learned and implemented the Dijkstra’s Algorithm — one of the most powerful algorithms for finding the shortest path in a weighted graph 🧭
#100DaysOfCode #GraphTheory #DataStructures #Algorithm #RohitNegi
shashi_bk_23's tweet image. 🚀 Day 12 of my Graphs Journey with Rohit Negi!
Today, I learned and implemented the Dijkstra’s Algorithm — one of the most powerful algorithms for finding the shortest path in a weighted graph 🧭
#100DaysOfCode #GraphTheory #DataStructures #Algorithm #RohitNegi
shashi_bk_23's tweet image. 🚀 Day 12 of my Graphs Journey with Rohit Negi!
Today, I learned and implemented the Dijkstra’s Algorithm — one of the most powerful algorithms for finding the shortest path in a weighted graph 🧭
#100DaysOfCode #GraphTheory #DataStructures #Algorithm #RohitNegi

🌉 Navigate the Weighted Bridges! Start at island A and reach island F by crossing bridges with weights. Can you find a path where the total weight is divisible by 7? Share your path and sum! 🗺️ #GraphTheory #LogicChallenge #maths #Engineering #logic #ENGINEと繋がりたい

rwenzorisafari's tweet image. 🌉 Navigate the Weighted Bridges! Start at island A and reach island F by crossing bridges with weights. Can you find a path where the total weight is divisible by 7? Share your path and sum! 🗺️ #GraphTheory #LogicChallenge #maths
#Engineering #logic
#ENGINEと繋がりたい

Day 56 of #100DaysOfDSA Learned DFS in graphs today. #DFS #GraphTheory #Coding #DSA #Java

NuzhatKhan08's tweet image. Day 56 of #100DaysOfDSA
Learned DFS in graphs today.
#DFS #GraphTheory #Coding #DSA #Java
NuzhatKhan08's tweet image. Day 56 of #100DaysOfDSA
Learned DFS in graphs today.
#DFS #GraphTheory #Coding #DSA #Java

An adjacency matrix is a way of representing a finite #graph. The matrix elements indicate whether pairs of vertices are adjacent or not in the graph. The eigenvalues and eigenvectors of an adjacency matrix are studied in #spectral #GraphTheory. #MathType #math #mathfacts

MathType's tweet image. An adjacency matrix is a way of representing a finite #graph. The matrix elements indicate whether pairs of vertices are adjacent or not in the graph. The eigenvalues and eigenvectors of an adjacency matrix are studied in #spectral #GraphTheory. 

#MathType #math #mathfacts

🚀 Day 317 of Code 🚀 Solved : ✅ 1061. Lexicographically Smallest Equivalent String (POTD) Today’s problem required constructing the smallest lexicographical string by mapping equivalence relationships between characters. #Day317 #GraphTheory #DFS #CharacterMapping #LeetCode

Mohd_Saqib_'s tweet image. 🚀 Day 317 of Code 🚀

Solved :

✅ 1061. Lexicographically Smallest Equivalent String (POTD)

Today’s problem required constructing the smallest lexicographical string by mapping equivalence relationships between characters.

#Day317 #GraphTheory #DFS #CharacterMapping #LeetCode

🔥 Day 171 of @LeetCode ! Solved "Counting Complete Components" using DFS, BFS & DSU 🚀 Shoutout to @CSwithMIK for the awesome Graph explanation! 🙌I am grateful about I am gradually diving into the Graph problems ! #LeetCode #GraphTheory

Pratikshak19332's tweet image. 🔥 Day 171 of @LeetCode !
Solved "Counting Complete Components" using DFS, BFS & DSU 🚀
Shoutout to @CSwithMIK  for the awesome Graph explanation! 🙌I am grateful about I am gradually diving into the Graph problems !
#LeetCode #GraphTheory
Pratikshak19332's tweet image. 🔥 Day 171 of @LeetCode !
Solved "Counting Complete Components" using DFS, BFS & DSU 🚀
Shoutout to @CSwithMIK  for the awesome Graph explanation! 🙌I am grateful about I am gradually diving into the Graph problems !
#LeetCode #GraphTheory
Pratikshak19332's tweet image. 🔥 Day 171 of @LeetCode !
Solved "Counting Complete Components" using DFS, BFS & DSU 🚀
Shoutout to @CSwithMIK  for the awesome Graph explanation! 🙌I am grateful about I am gradually diving into the Graph problems !
#LeetCode #GraphTheory

New proof settles decades-old bet about connected networks ow.ly/JzIE50VEotq @QuantaMagazine #mathematics #graphtheory

russellmanthy's tweet image. New proof settles decades-old bet about connected networks ow.ly/JzIE50VEotq @QuantaMagazine #mathematics #graphtheory

Solved a Medium-level DSA problem: Shortest Path in Undirected Graph with Unit Weights using #BFS in C++! 🔹 Found shortest distance from source ❌ Marked unreachable nodes as -1 #GraphTheory #DSA #CPlusPlus #Coding

ShristiRawat137's tweet image. Solved a Medium-level DSA problem: Shortest Path in Undirected Graph with Unit Weights using #BFS in C++!
🔹 Found shortest distance from source
❌ Marked unreachable nodes as -1
#GraphTheory #DSA #CPlusPlus #Coding

On August 13, 1968, Øystein Ore passed away. He was a Norwegian mathematician who specialized in Galois theory and graph theory. He was also interested in the history of mathematics. He is remembered for his theorem in graph theory. #GraphTheory #Algebra

diagonalizando's tweet image. On August 13, 1968, Øystein Ore passed away. He was a Norwegian mathematician who specialized in Galois theory and graph theory. He was also interested in the history of mathematics. He is remembered for his theorem in graph theory.
#GraphTheory #Algebra
diagonalizando's tweet image. On August 13, 1968, Øystein Ore passed away. He was a Norwegian mathematician who specialized in Galois theory and graph theory. He was also interested in the history of mathematics. He is remembered for his theorem in graph theory.
#GraphTheory #Algebra

Solved Directed Graph Cycle Detection using DFS! 🔁 Used a recursion stack to spot cycles in directed graphs. #DFS #GraphTheory #CycleDetection #LeetCode #Coding

ShristiRawat137's tweet image. Solved Directed Graph Cycle Detection using DFS! 🔁
Used a recursion stack to spot cycles in directed graphs.
#DFS #GraphTheory #CycleDetection #LeetCode #Coding

Addressing the issue of #fakenewsdetection, with a particular focus on solutions derived from #graphtheory: “Using graph solutions to identify "#trollfarms" and fake news propagation channels“ by P. Sulej, K. Hryniów. ACSIS Vol. 35 p.1161–1166; tinyurl.com/3jrc3w8h

annals_csis's tweet image. Addressing the issue of #fakenewsdetection, with a particular focus on solutions derived from #graphtheory: “Using graph solutions to identify "#trollfarms" and fake news propagation channels“ by P. Sulej, K. Hryniów. ACSIS Vol. 35 p.1161–1166; tinyurl.com/3jrc3w8h

Loading...

Something went wrong.


Something went wrong.


United States Trends