Skip to main content

Explore our questions

0 votes
1 answer
118 views

Minimum number of skips needed for shortest path

3 votes
2 answers
51 views

Vertex cover approximation: what's wrong with max-degree heuristic?

5 votes
1 answer
275 views

Computing a pre-topological sort using a BFS/a queue

1 vote
0 answers
10 views

Classical matrix multiplication via Min-Plus matrix multiplication

0 votes
1 answer
89 views

Calculate all distances in an undirected and unweighted graph

1 vote
2 answers
183 views

How to correctly describe this action, deleting an edge that "shortcut" some vertices

0 votes
0 answers
13 views

Why is it not possible to recognize a self-complementary graph just by searching for a self-complementary graph on $8$ vertices?

5 votes
0 answers
85 views

Polynomial time algorithms for graphs and cycles

1 vote
1 answer
28 views

Livout analysis of control flow graph of a program

0 votes
1 answer
247 views

MIT 6006 Quiz 2: The shortest path task

1 vote
1 answer
80 views

Showing that all Gomory-Hu trees of $K_{3,3}$ are stars with 5 edges

2 votes
1 answer
32 views

Rule-Based Link Prediction for Social Network

0 votes
1 answer
550 views

Determine endpoint of a graph given as a list of nodes + direct successors and predecessors

1 vote
1 answer
61 views

Are there any established methods for generating random graphs/networks that are both planar and meshlike?

Browse more Questions