Computer Science Stack Exchange

-1 votes

1 answer

220 views

Finding shortest path for DAG using dynamic programming vs topological sort?

graphs dynamic-programming shortest-path directed-graphs

CommunityBot

1

modified 10 hours ago

-1 votes

1 answer

44 views

Generating topological sequence from DAG with additional "not appearing before" constraints

algorithms graphs constraint-satisfaction dag

CommunityBot

1

modified 22 hours ago

-1 votes

1 answer

25 views

weighted graph separation algorithm proof

graphs optimization weighted-graphs

Steven

23.4k

answered yesterday

40 votes

9 answers

57k views

Algorithm to find diameter of a tree using BFS/DFS. Why does it work?

algorithms graphs search-algorithms trees graph-traversal

DanielV

486

modified yesterday

-1 votes

1 answer

49 views

Converting a Directed Acyclic Graph to a Directed Tree

graphs dag decomposition

Steven

23.4k

answered 2 days ago

0 votes

2 answers

53 views

Calculate shortest cycle that contains node $s$

graphs shortest-path weighted-graphs

Majid Zohrehbandian

172

answered Jun 30 at 19:22

2 votes

0 answers

45 views

Subgraph Isomorphism with Same Number of Nodes

complexity-theory graphs parameterized-complexity graph-isomorphism

Siolan

21

modified Jun 30 at 11:39

7 votes

1 answer

260 views

Polynomial time algorithm for finding a maximal monotone subset

algorithms graphs np-complete subsequences

CommunityBot

1

modified Jun 30 at 6:01

2 votes

1 answer

65 views

Efficient algorithm to count number of intersections of n sets

algorithms graphs optimization sets

snow

23

modified Jun 28 at 23:08

3 votes

1 answer

382 views

How to encode reachability in a graph with walls as a SAT problem

algorithms graphs reductions satisfiability

CommunityBot

1

modified Jun 27 at 19:03

1 vote

2 answers

67 views

Are Control Flow Graphs(CFG) planar?

graphs planar-graphs

DatoClement

188

modified Jun 26 at 3:17

0 votes

2 answers

81 views

Prove there is an algorithm that needs at most n-1 comparisons to check if n-element array has all equal elements?

algorithms graphs proof-techniques correctness-proof

Yves Daoust

3,912

modified Jun 24 at 8:50

0 votes

1 answer

44 views

Calculate post dominator with non exiting control flow

graphs compilers static-analysis

CommunityBot

1

modified Jun 24 at 8:06

0 votes

1 answer

33 views

Recursively deleting spanning forest from graph, how many iterations maximum to get to the empty graph?

graphs spanning-trees matroids

nir shahar

10.8k

modified Jun 24 at 4:33

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore our questions

Finding shortest path for DAG using dynamic programming vs topological sort?

Generating topological sequence from DAG with additional "not appearing before" constraints

weighted graph separation algorithm proof

Algorithm to find diameter of a tree using BFS/DFS. Why does it work?

Converting a Directed Acyclic Graph to a Directed Tree

Calculate shortest cycle that contains node $s$

Subgraph Isomorphism with Same Number of Nodes

Polynomial time algorithm for finding a maximal monotone subset

Efficient algorithm to count number of intersections of n sets

How to encode reachability in a graph with walls as a SAT problem

Are Control Flow Graphs(CFG) planar?

Prove there is an algorithm that needs at most n-1 comparisons to check if n-element array has all equal elements?

Calculate post dominator with non exiting control flow

Recursively deleting spanning forest from graph, how many iterations maximum to get to the empty graph?

Hot Network Questions