Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.

Sign up to join this community

Anybody can ask a question

Anybody can answer

The best answers are voted up and rise to the top

Explore our Questions

Ask Question

more tags

Active Hot Week Month

0

votes

0

answers

9

views

Minimum vertex cover and odd cycles

algorithms graphs optimization linear-programming vertex-cover

asked 2 hours ago Mario Giambarioli 117

4

votes

1

answer

77

views

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

algorithms graphs graph-traversal connected-components

modified 7 hours ago Community♦ 1

2

votes

1

answer

52

views

Calculate the area of the shape created by multiple paths

algorithms graphs graph-traversal

answered 12 hours ago drewag 121

11

votes

4

answers

18k

views

Finding a source of a directed acyclic graph in linear time

algorithms graphs

modified yesterday xskxzr 6,420

0

votes

0

answers

42

views

Why did Hopcroft and Karp write $M_0, M_1, M_2, \cdots, M_i, \cdots$? (Hopcroft - Karp Algorithm)

graphs matching bipartite-matching

asked yesterday tchappy ha 111

11

votes

4

answers

55k

views

Difference between cross edges and forward edges in a DFT

algorithms terminology graphs graph-traversal

answered yesterday BigManBabs 1

0

votes

0

answers

19

views

BFS Traversal over a graph question

graphs breadth-first-search

asked yesterday StackOMeow 125

0

votes

1

answer

28

views

social network analysis - relations between people with weights

algorithms graphs

modified yesterday Tassle 1,442

5

votes

2

answers

317

views

Building maze to maximize shortest path, may be given waypoints and teleports

algorithms complexity-theory graphs algorithm-analysis

modified 2 days ago Vor 11.8k

0

votes

1

answer

88

views

MIT 6006 Quiz 2: The shortest path task

algorithms graphs shortest-path

modified 2 days ago Community♦ 1

10

votes

1

answer

248

views

Shortest Path in a Directed Acyclic Graph with two types of costs

algorithms graphs shortest-path weighted-graphs dag

modified Aug 7 at 18:10 Kaban-5 424

2

votes

1

answer

95

views

Minimum vertex cover algorithm with linear programming

algorithms graphs optimization linear-programming vertex-cover

modified Aug 7 at 8:34 xskxzr 6,420

-1

votes

3

answers

322

views

Greedy algorithm for vertex cover

algorithms complexity-theory graphs np-complete vertex-cover

modified Aug 7 at 8:22 Anthony Labarre 306

6

votes

1

answer

219

views

Is there a reasonable algorithm to generate a certain “independent clique graph” with minimal vertices?

graphs clique

modified Aug 6 at 20:01 Community♦ 1

Browse more Questions

Computer Science Stack Exchange works best with JavaScript enabled