Skip to main content
OverflowAI is here! AI power for your Stack Overflow for Teams knowledge community. Learn more
orezvani's user avatar
orezvani's user avatar
orezvani's user avatar
orezvani
  • Member for 10 years, 1 month
  • Last seen more than a month ago
  • Iran
15 votes
Accepted

Maximum subset pairwise not divisible by $K$

11 votes
Accepted

What is the difference between a R-tree and a BVH?

6 votes
Accepted

number of edges in a graph

5 votes

Reachability queries on uncertain graphs

5 votes

Why does the formula 2n + 1 find the child node in a binary heap?

4 votes
Accepted

Betweenness Centrality measurement in Undirected Graphs

4 votes

What's the big deal with the knapsack problem?

4 votes
Accepted

How can an approximation ratio be less than 1?

4 votes
Accepted

What is the difference between F+ (closure of F) and F* (cover of F) for Functional Dependencies?

4 votes

Ideal value of d in a d-ary heap for Dijkstra's algorithm

3 votes

What is the intuition on why the longest path problem does not have optimal substructure?

3 votes
Accepted

Densely connected non overlapping subgraph

2 votes
Accepted

Complexity of the Dijkstra algorithm

2 votes
Accepted

Minimum Weight Directed Subgraph ensuring all pairs reachability?

2 votes
Accepted

Community detection in weighted directed graphs for fixed number of communities

2 votes
Accepted

Is this argument wrong "since DOM is special kind of RDOM, then RDOM is NP-hard"?

2 votes

Reading CLRS analysis of hashing with chaining

2 votes

What are applications of Coin Change problem?

2 votes

What is the definition of a problem

2 votes

Betweenness centrality measurement ignoring inverse paths?

2 votes

Does $\mathsf{P} \ne \mathsf{NP}$ imply that $|\mathsf{NP}| > |\mathsf{P}|$?

2 votes

Create a random graph based on the Degree Distribution and Clustering Coefficient Distribution

2 votes

Stuck on a combinations algo question

1 vote

Average Case Analysis for finding max and min value on an array

1 vote

Definition of a reachable ancestor (Skiena TADM 2nd ed section 5.9.2)

1 vote

a cut containing exactly one edge in each path

1 vote
Accepted

Devise algorithm to travel destinations in a way that you always have enough money for the next destination (getting paid at each destination as well)

1 vote

Finding maximum clique in a distance matrix created by certain pattern

1 vote

Algorithm to find most efficent partitioning of a set

1 vote

web content "mining" using supervised learning tequniques