Computer Science Stack Exchange

3

votes

1

answer

60

views

Does a Minimum-Spanning-Tree always give a lower bound for the weight of any Hamiltonian cycle of the graph?

complexity-theory graphs

modified 9 hours ago lox 1,007

4

votes

3

answers

183

views

Are edges in a minimum spanning tree not heavier than respective edges in another spanning tree?

algorithms graphs minimum-spanning-tree

modified 13 hours ago Community♦ 1

4

votes

1

answer

92

views

Matching Algorithm - How to maximize matched quantity with unique matching rules?

algorithms graphs time-complexity matching bipartite-matching

modified 18 hours ago luca590 121

0

votes

0

answers

12

views

What is a polynomial-time algorithm for determining whether two trees, with colored nodes, are isomorphic or not

graphs graph-theory trees colorings graph-isomorphism

asked yesterday Toothpick Anemone 188

5

votes

1

answer

782

views

What is the time complexity of the classic Bron-Kerbosch algorithm for finding cliques?

graphs time-complexity clique

modified yesterday Zi Chen 1

1

vote

0

answers

27

views

Given complete graph, find optimal path with two costs on each edge

graphs shortest-path

modified yesterday BlueRaja - Danny Pflughoeft 885

1

vote

2

answers

26

views

What is the graphic TSP?

graphs weighted-graphs traveling-salesman

answered 2 days ago David Richerby 72.6k

1

vote

1

answer

132

views

how to find total paths in a graph which have only one vertex common with a given path

algorithms graphs trees

modified Jun 13 at 8:19 Vince 1,008

0

votes

0

answers

970

views

Shortest Path using DFS on weighted graphs

algorithms graphs graph-traversal

modified Jun 13 at 4:38 Anmol Middha 1

2

votes

1

answer

105

views

+50

Algorithm for fewest number of moves with artificial minimum

algorithms graphs coin-change

modified Jun 12 at 20:32 David Fox 73

3

votes

0

answers

36

views

Assign weights to the edges in a DAG so that, for all S and T, all paths from S to T have equal weight

algorithms graphs weighted-graphs dag

modified Jun 12 at 19:20 Paul Accisano 116

1

vote

1

answer

26

views

Shortest path in a incomplete graph

algorithms graphs data-structures shortest-path efficiency

answered Jun 12 at 19:10 David Richerby 72.6k

1

vote

1

answer

2k

views

Checking whether two paths are intersecting in a tree

algorithms graphs trees

modified Jun 12 at 7:09 Vasu 1

3

votes

2

answers

52

views

Count paths of length $n$ that a player can take

algorithms graphs combinatorics

modified Jun 12 at 6:22 kyle_williams 16

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore Our Questions

Does a Minimum-Spanning-Tree always give a lower bound for the weight of any Hamiltonian cycle of the graph?

Are edges in a minimum spanning tree not heavier than respective edges in another spanning tree?

Matching Algorithm - How to maximize matched quantity with unique matching rules?

What is a polynomial-time algorithm for determining whether two trees, with colored nodes, are isomorphic or not

What is the time complexity of the classic Bron-Kerbosch algorithm for finding cliques?

Given complete graph, find optimal path with two costs on each edge

What is the graphic TSP?

how to find total paths in a graph which have only one vertex common with a given path

Shortest Path using DFS on weighted graphs

Algorithm for fewest number of moves with artificial minimum

Assign weights to the edges in a DAG so that, for all S and T, all paths from S to T have equal weight

Shortest path in a incomplete graph

Checking whether two paths are intersecting in a tree

Count paths of length $n$ that a player can take

Hot Network Questions