Explore our questions

2 votes
2 answers
127 views

property of minimal triangulations

2 votes
1 answer
263 views

A non-trivial combinatorial optimization

0 votes
0 answers
281 views

Number of leaves in decision tree

0 votes
0 answers
115 views

Error in TAOCP 4a on the bipartite graph constructed from a hypergraph

3 votes
1 answer
69 views

What is the fastest algorithm for computing exact network reliability?

1 vote
0 answers
122 views

Upper bound on the number of maximal paths in rooted intransitive DAGs

0 votes
1 answer
167 views

Finding the shortest cycle containing a vertex in a graph

3 votes
2 answers
154 views

Given a weighted graph with $pk$ nodes find a min weight forest with $p$ components each containing exactly $k$ nodes

5 votes
0 answers
117 views

What is the smallest graph of treewidth $k$ having less edges than the $(k+1)$-clique?

8 votes
1 answer
2k views

How bad can the greedy coloring (list color) for the c-chromatic number of graph be?

0 votes
0 answers
45 views

Is hypergraph reachability definable in MSO?

-1 votes
0 answers
60 views

Stoer-Wagner algorithm optimization

1 vote
1 answer
134 views

Efficient Algorithm for Partitioning a Directed Acyclic Graph into Short Paths

7 votes
1 answer
555 views

Connectivity of a random regular graph of degree $d$

Browse more Questions