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

2 votes
1 answer
28 views
Retrieving the cheapest path of a graph with time-dependent edge weights
0 votes
0 answers
24 views
Graph theory book for beginners
1 vote
1 answer
25 views
crossings of edges of a geometric graph
0 votes
1 answer
163 views
Literature request: Generating all vertex subsets of a graph
0 votes
0 answers
17 views
Is there an algorithm to efficiently generate all partitions of a set such that no cell contains fewer than k elements of the set?
5 votes
0 answers
97 views
+50
Optimization on hypergraph "refinements"
0 votes
1 answer
14 views
Calculate post dominator with non exiting control flow
0 votes
1 answer
38 views
Prove there is an algorithm that needs at most n-1 comparisons to check if n-element array has all equal elements?
0 votes
1 answer
68 views
How to find the maximum number of square groups in a board
1 vote
0 answers
15 views
Finding highly-connected regions of graphs
0 votes
1 answer
13 views
Define a directed edge in a DAG using partial ordering
0 votes
0 answers
18 views
Polynomial Deterministic Algorithm for MAX-QP problem with multiplicative errror $1/n$
1 vote
1 answer
8 views
Max-Min Weighted Matching
1 vote
0 answers
15 views
A paper seems to mention a planar graph's "faces" in an embedding-less context
Browse more Questions