How To Find A Perfect Match
This article presents a way that finds a perfect match in any bipartite graph or shows why one cannot exist.
2021-09-06
2,937 reads
This article presents a way that finds a perfect match in any bipartite graph or shows why one cannot exist.
2021-09-06
2,937 reads
Introduction This article shows how common table expressions (CTE) in SQL Server are naturally suited for navigating trees, such as finding its longest path, or diameter. Recall that a tree is an undirected graph where unique paths exist between any two nodes (i.e. vertices). Any node may be selected as its top node, with its […]
2021-04-19
8,107 reads
By Steve Jones
I coach volleyball and I do a lot of stat stuff on paper. I...
By Steve Jones
dolorblindness – n. the frustration that you’ll never be able to understand another person’s...
By Steve Jones
I had a customer ask about analyzing their Test Data Manager (TDM) usage to...
Is there a good syllabus for reading these two together? (Yes, it's called the...
Comments posted to this topic are about the item GPX distance and time analysis...
Comments posted to this topic are about the item The DBA is Dead; Long...
In SQL Server 2025, if I want to remove an IP from a listener, what do I do?
See possible answers