ORGEval: Graph-Theoretic Evaluation of LLMs in Optimization Modeling
Angyang Gu, Congliang Chen et al.
Paper
Details
#ORGEval #GraphTheory #LargeLanguageModels
Angyang Gu, Congliang Chen et al.
Paper
Details
#ORGEval #GraphTheory #LargeLanguageModels
November 6, 2025 at 5:01 PM
ORGEval: Graph-Theoretic Evaluation of LLMs in Optimization Modeling
Angyang Gu, Congliang Chen et al.
Paper
Details
#ORGEval #GraphTheory #LargeLanguageModels
Angyang Gu, Congliang Chen et al.
Paper
Details
#ORGEval #GraphTheory #LargeLanguageModels
A new inquiry activity is posted on Fractal Kitty!
www.fractalkitty.com/inquiries-we...
This one plays with graphs and can be used as an extension to Sim, Don't Make a Triangle, and other such games.
#mtbos #iteachmath #mathplay #accessibleProofs #inquiry #turan #graphTheory #triangles
www.fractalkitty.com/inquiries-we...
This one plays with graphs and can be used as an extension to Sim, Don't Make a Triangle, and other such games.
#mtbos #iteachmath #mathplay #accessibleProofs #inquiry #turan #graphTheory #triangles
Inquiries-Week 5: Triangles Emerge
Introduction
In this inquiry, nodes are connected one at a time. How many lines can you draw before a triangle emerges?
Starting with Four
Let's start with four nodes - draw them on a sheet of pap...
www.fractalkitty.com
November 6, 2025 at 7:57 AM
A new inquiry activity is posted on Fractal Kitty!
www.fractalkitty.com/inquiries-we...
This one plays with graphs and can be used as an extension to Sim, Don't Make a Triangle, and other such games.
#mtbos #iteachmath #mathplay #accessibleProofs #inquiry #turan #graphTheory #triangles
www.fractalkitty.com/inquiries-we...
This one plays with graphs and can be used as an extension to Sim, Don't Make a Triangle, and other such games.
#mtbos #iteachmath #mathplay #accessibleProofs #inquiry #turan #graphTheory #triangles
In fact in this example, 3 guards suffice. Minimal guarding is an NP-hard problem, i.e., intractable.
#Mathematics #MathSky #GraphTheory
www.science.smith.edu/~jorourke/bo...
#Mathematics #MathSky #GraphTheory
www.science.smith.edu/~jorourke/bo...
November 2, 2025 at 11:11 PM
In fact in this example, 3 guards suffice. Minimal guarding is an NP-hard problem, i.e., intractable.
#Mathematics #MathSky #GraphTheory
www.science.smith.edu/~jorourke/bo...
#Mathematics #MathSky #GraphTheory
www.science.smith.edu/~jorourke/bo...
"Louvre robbery: Could a 50-year-old maths problem have kept the museum safe?" This is a BBC article by Kit Yates about the art gallery theorem. In the figure, four red vertex guards suffice to visually cover the whole polygon. #Mathematics #MathSky #GraphTheory www.bbc.com/future/artic...
November 2, 2025 at 11:03 PM
"Louvre robbery: Could a 50-year-old maths problem have kept the museum safe?" This is a BBC article by Kit Yates about the art gallery theorem. In the figure, four red vertex guards suffice to visually cover the whole polygon. #Mathematics #MathSky #GraphTheory www.bbc.com/future/artic...
Many clarified Graphviz isn't just one tool: it's a framework with various layout engines (like "dot") and the DOT language. Understanding these distinctions is key to leveraging its full capabilities effectively. #GraphTheory 3/6
October 30, 2025 at 7:00 PM
Many clarified Graphviz isn't just one tool: it's a framework with various layout engines (like "dot") and the DOT language. Understanding these distinctions is key to leveraging its full capabilities effectively. #GraphTheory 3/6
Separations between Oblivious and Adaptive Adversaries for Natural
Dynamic Graph Problems
Aaron Bernstein, Nick Fischer et al.
Paper
Details
#GraphTheory #MachineLearning #AdversarialRobustness
Dynamic Graph Problems
Aaron Bernstein, Nick Fischer et al.
Paper
Details
#GraphTheory #MachineLearning #AdversarialRobustness
October 25, 2025 at 4:01 PM
Separations between Oblivious and Adaptive Adversaries for Natural
Dynamic Graph Problems
Aaron Bernstein, Nick Fischer et al.
Paper
Details
#GraphTheory #MachineLearning #AdversarialRobustness
Dynamic Graph Problems
Aaron Bernstein, Nick Fischer et al.
Paper
Details
#GraphTheory #MachineLearning #AdversarialRobustness
🧠 How rust-semverx uses Eulerian + Hamiltonian cycles:
Eulerian: Visits all edges (dependencies)
Hamiltonian: Visits all nodes (components)
Together: Perfect dependency resolution! 🎯
Deep dive: youtube.com/@OBINexus/pl...
Code: github.com/obinexus/rus...
#GraphTheory #Algorithms #ComputerScience
Eulerian: Visits all edges (dependencies)
Hamiltonian: Visits all nodes (components)
Together: Perfect dependency resolution! 🎯
Deep dive: youtube.com/@OBINexus/pl...
Code: github.com/obinexus/rus...
#GraphTheory #Algorithms #ComputerScience
OBINexus
OBINexus: The World's First Design & Technology Company Constitution
MOTTO - "When systems fail, build your OWN"- And I did just that
OBI = Heart/Soul (Soul in the project of earth, Heart in the re...
youtube.com
October 20, 2025 at 5:47 PM
🧠 How rust-semverx uses Eulerian + Hamiltonian cycles:
Eulerian: Visits all edges (dependencies)
Hamiltonian: Visits all nodes (components)
Together: Perfect dependency resolution! 🎯
Deep dive: youtube.com/@OBINexus/pl...
Code: github.com/obinexus/rus...
#GraphTheory #Algorithms #ComputerScience
Eulerian: Visits all edges (dependencies)
Hamiltonian: Visits all nodes (components)
Together: Perfect dependency resolution! 🎯
Deep dive: youtube.com/@OBINexus/pl...
Code: github.com/obinexus/rus...
#GraphTheory #Algorithms #ComputerScience
🧠 How rust-semverx uses Eulerian + Hamiltonian cycles:
Eulerian: Visits all edges (dependencies)
Hamiltonian: Visits all nodes (components)
Together: Perfect dependency resolution! 🎯
Deep dive: youtube.com/@OBINexus/pl...
Code: github.com/obinexus/rus...
#GraphTheory #Algorithms #ComputerScience
Eulerian: Visits all edges (dependencies)
Hamiltonian: Visits all nodes (components)
Together: Perfect dependency resolution! 🎯
Deep dive: youtube.com/@OBINexus/pl...
Code: github.com/obinexus/rus...
#GraphTheory #Algorithms #ComputerScience
OBINexus
OBINexus: The World's First Design & Technology Company Constitution
MOTTO - "When systems fail, build your OWN"- And I did just that
OBI = Heart/Soul (Soul in the project of earth, Heart in the re...
youtube.com
October 20, 2025 at 5:47 PM
🧠 How rust-semverx uses Eulerian + Hamiltonian cycles:
Eulerian: Visits all edges (dependencies)
Hamiltonian: Visits all nodes (components)
Together: Perfect dependency resolution! 🎯
Deep dive: youtube.com/@OBINexus/pl...
Code: github.com/obinexus/rus...
#GraphTheory #Algorithms #ComputerScience
Eulerian: Visits all edges (dependencies)
Hamiltonian: Visits all nodes (components)
Together: Perfect dependency resolution! 🎯
Deep dive: youtube.com/@OBINexus/pl...
Code: github.com/obinexus/rus...
#GraphTheory #Algorithms #ComputerScience
Combinatorial Comparison of Trace Monoids via Their Dependence Graph Symmetries
www.mdpi.com/2504-3900/12...
By Ioannis Michos and Constantinos Kourouzides
From the Symmetry 2025 Conference
#GraphTheory #FormalMethods #Combinatorics
www.mdpi.com/2504-3900/12...
By Ioannis Michos and Constantinos Kourouzides
From the Symmetry 2025 Conference
#GraphTheory #FormalMethods #Combinatorics
www.mdpi.com
October 20, 2025 at 2:25 PM
Combinatorial Comparison of Trace Monoids via Their Dependence Graph Symmetries
www.mdpi.com/2504-3900/12...
By Ioannis Michos and Constantinos Kourouzides
From the Symmetry 2025 Conference
#GraphTheory #FormalMethods #Combinatorics
www.mdpi.com/2504-3900/12...
By Ioannis Michos and Constantinos Kourouzides
From the Symmetry 2025 Conference
#GraphTheory #FormalMethods #Combinatorics
📊Fri (Poster 4909F) - Yunjun Kang applied #GraphTheory & #MachineLearning to find hidden gene-gene links in big human data, identifying 2 novel cilium genes that validated in the wet lab; his approach could change how we uncover mechanism & therapeutic targets in human datasets
October 13, 2025 at 8:51 PM
📊Fri (Poster 4909F) - Yunjun Kang applied #GraphTheory & #MachineLearning to find hidden gene-gene links in big human data, identifying 2 novel cilium genes that validated in the wet lab; his approach could change how we uncover mechanism & therapeutic targets in human datasets
After all, spotted a paper that comes without “AI“ as method!
The authors present a graph-theory-based framework for 2D MS/MS, enabling <1s/sample de novo sequencing via PageRank-based ion grouping & fragmentation tree reconstruction:
pubs.rsc.org/en/content/a...
#MassSpec #GraphTheory
The authors present a graph-theory-based framework for 2D MS/MS, enabling <1s/sample de novo sequencing via PageRank-based ion grouping & fragmentation tree reconstruction:
pubs.rsc.org/en/content/a...
#MassSpec #GraphTheory
Framework for de novo sequencing of peptide mixtures via network analysis and two-dimensional tandem mass spectrometry
Two-dimensional tandem mass spectrometry (2D MS/MS) provides in-depth biopolymer structural information previously not directly accessible with traditional one-dimensional MS/MS workflows, and in sign...
pubs.rsc.org
October 9, 2025 at 10:45 AM
After all, spotted a paper that comes without “AI“ as method!
The authors present a graph-theory-based framework for 2D MS/MS, enabling <1s/sample de novo sequencing via PageRank-based ion grouping & fragmentation tree reconstruction:
pubs.rsc.org/en/content/a...
#MassSpec #GraphTheory
The authors present a graph-theory-based framework for 2D MS/MS, enabling <1s/sample de novo sequencing via PageRank-based ion grouping & fragmentation tree reconstruction:
pubs.rsc.org/en/content/a...
#MassSpec #GraphTheory
The study shows HIST detection is polynomial‑time for chordal graphs with diameter ≤ 3, but NP‑complete for strongly chordal graphs with diameter 4. Overall, it maps the boundary. https://getnews.me/new-study-maps-complexity-landscape-of-hist-problem-in-graph-theory/ #graphtheory #algorithm
October 8, 2025 at 1:21 AM
The study shows HIST detection is polynomial‑time for chordal graphs with diameter ≤ 3, but NP‑complete for strongly chordal graphs with diameter 4. Overall, it maps the boundary. https://getnews.me/new-study-maps-complexity-landscape-of-hist-problem-in-graph-theory/ #graphtheory #algorithm
A hybrid quantum-classical algorithm lets researchers dive deeper into graph structures, transforming network analysis in fields like social media, biology, and logistics. How could this innovation impact your work? #QuantumComputing #GraphTheory #DataScience LINK
October 7, 2025 at 2:19 PM
A hybrid quantum-classical algorithm lets researchers dive deeper into graph structures, transforming network analysis in fields like social media, biology, and logistics. How could this innovation impact your work? #QuantumComputing #GraphTheory #DataScience LINK
Air dry clay math fun. The "amplituhedron" (not to scale, yet) of a simple four piece tiling puzzle called SIXL(six unique tilings).
Thanks @quantamagazine.bsky.social for the amplituhedron article(link in comments).
#graphtheory #pentominoes #tiling #combinatorics #clay
#mathart
Thanks @quantamagazine.bsky.social for the amplituhedron article(link in comments).
#graphtheory #pentominoes #tiling #combinatorics #clay
#mathart
October 6, 2025 at 3:59 PM
Air dry clay math fun. The "amplituhedron" (not to scale, yet) of a simple four piece tiling puzzle called SIXL(six unique tilings).
Thanks @quantamagazine.bsky.social for the amplituhedron article(link in comments).
#graphtheory #pentominoes #tiling #combinatorics #clay
#mathart
Thanks @quantamagazine.bsky.social for the amplituhedron article(link in comments).
#graphtheory #pentominoes #tiling #combinatorics #clay
#mathart
New research shows graphs whose edges are covered by k shortest paths have pathwidth O(k⁴), improving the previous O(3^k) bound. For k ≤ 3 the pathwidth equals k. https://getnews.me/polynomial-pathwidth-bound-for-graphs-covered-by-shortest-paths/ #graphtheory #pathwidth #algorithms
October 6, 2025 at 12:01 PM
New research shows graphs whose edges are covered by k shortest paths have pathwidth O(k⁴), improving the previous O(3^k) bound. For k ≤ 3 the pathwidth equals k. https://getnews.me/polynomial-pathwidth-bound-for-graphs-covered-by-shortest-paths/ #graphtheory #pathwidth #algorithms
The Proof Is Trivial (And So Is Existence)
#Math #Topology #Graphtheory #Euler #History
https://sciencehumor.io/math-memes/the-proof-is-trivial-and-so-is-existence-r6bh
#Math #Topology #Graphtheory #Euler #History
https://sciencehumor.io/math-memes/the-proof-is-trivial-and-so-is-existence-r6bh
October 6, 2025 at 2:17 AM
The Proof Is Trivial (And So Is Existence)
#Math #Topology #Graphtheory #Euler #History
https://sciencehumor.io/math-memes/the-proof-is-trivial-and-so-is-existence-r6bh
#Math #Topology #Graphtheory #Euler #History
https://sciencehumor.io/math-memes/the-proof-is-trivial-and-so-is-existence-r6bh
October 4, 2025 at 12:07 AM
Defected Temporal Graphs (DTGs) give asymptotic stability to the Friedkin‑Johnsen opinion model; semi‑periodic defected networks achieve exponential stability. https://getnews.me/graph-theory-confirms-stability-of-time-varying-opinion-dynamics/ #graphtheory #opiniondynamics
October 3, 2025 at 9:13 PM
Defected Temporal Graphs (DTGs) give asymptotic stability to the Friedkin‑Johnsen opinion model; semi‑periodic defected networks achieve exponential stability. https://getnews.me/graph-theory-confirms-stability-of-time-varying-opinion-dynamics/ #graphtheory #opiniondynamics
Researchers prove throttling numbers are NP‑hard for metric, edge and mixed metric dimensions, and the smallest value scales as Θ(log n / log log n) in graphs. Read more: https://getnews.me/new-study-introduces-throttling-strategies-for-metric-dimension-in-graphs/ #metricdimension #graphtheory
October 3, 2025 at 5:19 AM
Researchers prove throttling numbers are NP‑hard for metric, edge and mixed metric dimensions, and the smallest value scales as Θ(log n / log log n) in graphs. Read more: https://getnews.me/new-study-introduces-throttling-strategies-for-metric-dimension-in-graphs/ #metricdimension #graphtheory
A new paper gives exact Shannon capacities for q‑Kneser and Tadpole graphs and proves an inequality linking strong product to disjoint union capacities. https://getnews.me/new-methods-simplify-shannon-capacity-calculations-for-graphs/ #shannoncapacity #graphtheory
October 1, 2025 at 6:28 AM
A new paper gives exact Shannon capacities for q‑Kneser and Tadpole graphs and proves an inequality linking strong product to disjoint union capacities. https://getnews.me/new-methods-simplify-shannon-capacity-calculations-for-graphs/ #shannoncapacity #graphtheory
A new study on edge inducibility, submitted 28 September 2025, shows the problem is computationally hard and gives exact values for all graphs up to four vertices. Read more: https://getnews.me/new-study-introduces-edge-inducibility-problem-in-graph-theory/ #graphtheory #inducibility
October 1, 2025 at 5:47 AM
A new study on edge inducibility, submitted 28 September 2025, shows the problem is computationally hard and gives exact values for all graphs up to four vertices. Read more: https://getnews.me/new-study-introduces-edge-inducibility-problem-in-graph-theory/ #graphtheory #inducibility
#ecsmonday on BS #18
Which node is the most important in the #fracturenetwork to determine the preferential #fluidpath?
Check out the example from the #SwissAlps by Ana Paula Burgoa Tanaka et al. (CH):
doi.org/10.1016/j.js...
#structuralgeology #2danalysis #graphtheory #topology #fracture
Which node is the most important in the #fracturenetwork to determine the preferential #fluidpath?
Check out the example from the #SwissAlps by Ana Paula Burgoa Tanaka et al. (CH):
doi.org/10.1016/j.js...
#structuralgeology #2danalysis #graphtheory #topology #fracture
September 29, 2025 at 10:49 AM
#ecsmonday on BS #18
Which node is the most important in the #fracturenetwork to determine the preferential #fluidpath?
Check out the example from the #SwissAlps by Ana Paula Burgoa Tanaka et al. (CH):
doi.org/10.1016/j.js...
#structuralgeology #2danalysis #graphtheory #topology #fracture
Which node is the most important in the #fracturenetwork to determine the preferential #fluidpath?
Check out the example from the #SwissAlps by Ana Paula Burgoa Tanaka et al. (CH):
doi.org/10.1016/j.js...
#structuralgeology #2danalysis #graphtheory #topology #fracture
Researchers introduced circular-arc H-graphs, extending circular-arc graphs, and gave ordering-based characterizations. Submitted 22 September 2025. Read more: https://getnews.me/new-study-introduces-circular-arc-h-graphs-and-their-ordering-rules/ #circulararc #graphtheory #algorithms
September 25, 2025 at 6:05 AM
Researchers introduced circular-arc H-graphs, extending circular-arc graphs, and gave ordering-based characterizations. Submitted 22 September 2025. Read more: https://getnews.me/new-study-introduces-circular-arc-h-graphs-and-their-ordering-rules/ #circulararc #graphtheory #algorithms
Stop playing whack-a-mole with costs. Start systematically engineering better architectures.
🎧 open.spotify.com/episode/3IXR...
#CloudOptimization #GraphTheory #TechPodcast #FinOpsRetry
🎧 open.spotify.com/episode/3IXR...
#CloudOptimization #GraphTheory #TechPodcast #FinOpsRetry
CloudCostChefs - Democratizing FinOps
Free tools and resources to optimize cloud costs for everyone
cloudcostchefs.com
September 24, 2025 at 6:00 PM
Stop playing whack-a-mole with costs. Start systematically engineering better architectures.
🎧 open.spotify.com/episode/3IXR...
#CloudOptimization #GraphTheory #TechPodcast #FinOpsRetry
🎧 open.spotify.com/episode/3IXR...
#CloudOptimization #GraphTheory #TechPodcast #FinOpsRetry
They Did The Monster Math
#Math #Puns #Graphtheory #Monstermath #Nerdhumor
https://sciencehumor.io/math-memes/they-did-the-monster-math-igyh
#Math #Puns #Graphtheory #Monstermath #Nerdhumor
https://sciencehumor.io/math-memes/they-did-the-monster-math-igyh
September 23, 2025 at 5:01 PM
They Did The Monster Math
#Math #Puns #Graphtheory #Monstermath #Nerdhumor
https://sciencehumor.io/math-memes/they-did-the-monster-math-igyh
#Math #Puns #Graphtheory #Monstermath #Nerdhumor
https://sciencehumor.io/math-memes/they-did-the-monster-math-igyh