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 1 Bountied Hot Week Month

0

votes

1

answer

66

views

Does an algorithm exist that transforms any connected graph, cyclic or not, into tree form?

graphs trees

modified 1 hour ago Community♦ 1

1

vote

0

answers

19

views

Build a Turing machine to prove that a problem is $NL$

complexity-theory graphs space-complexity

asked 3 hours ago Xavi 128

0

votes

0

answers

9

views

Constrained/Optimal Topological Order to enhance/reduce the performance/memory usage of other algorithms

graphs optimization dynamic-programming graph-traversal topological-ordering

asked 6 hours ago Luxii 1

3

votes

2

answers

1k

views

is it possible to determine using a single depth-first search, in O(V+E) time, whether a directed graph is singly connected?

graphs graph-traversal

modified yesterday Community♦ 1

0

votes

1

answer

72

views

Disjoint Set Connected Components With Weighted Graph

algorithms graphs data-structures trees sets

modified yesterday Community♦ 1

0

votes

0

answers

23

views

Question of about Boltzmann machine implementation

algorithms graphs machine-learning boltzmann-machine

asked yesterday titanium 101

0

votes

1

answer

26

views

How to Draw the planar embedding of a graph?

graphs planar-graphs

answered 2 days ago Rick Decker 14.2k

0

votes

1

answer

25

views

Clustering Formulas for Networks

graphs clustering

answered 2 days ago Inuyasha Yagami 1,818

1

vote

1

answer

13

views

Minimal cut of a directed graph such that disjoint elements are strongly connected

algorithms graphs connected-components directed-graphs

answered 2 days ago nir shahar 6,023

2

votes

1

answer

47

views

Partition of a $k$-partite graph to minimal number of connected sets

algorithms graphs greedy-algorithms partitions dag

answered 2 days ago Highheath 425

4

votes

0

answers

34

views

Using graph symmetries to speed up subgraph enumeration

graphs optimization search-algorithms enumeration group-theory

modified 2 days ago D.W.♦ 132k

2

votes

2

answers

1k

views

How does Dijkstra's problem 1 (tree of minimal total length) work and what does it do?

graphs spanning-trees dijkstras-algorithm

modified Jun 21 at 15:09 Inuyasha Yagami 1,818

1

vote

1

answer

23

views

How many colors will be used in the following bipartite graph

graphs colorings

answered Jun 21 at 11:54 Yuval Filmus 254k

1

vote

2

answers

43

views

Finding the perfect matching

graphs

modified Jun 21 at 10:48 Steven 15.5k

Browse more Questions

Computer Science Stack Exchange works best with JavaScript enabled