Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with trees
Search options not deleted
user 114153
Questions about a special kind of graphs, namely connected and cycle-free ones.
0
votes
0
answers
407
views
modifing CYK to compute the number of different parsing trees of a given sentence
I want to count the number of different parsing trees that parses s.
assuming I know how to change the CYK algorithm so it would count the number of parsing trees, how can I determine if one tree X is … to save all the previous parsing trees in a data structure... …
- 157
2
votes
1
answer
110
views
Prove that there is a sequence of k minimum spaning trees between two distinct minimum spann... [duplicate]
I'm pracitcing exams towards finals,
Given an undirected graph $G(V,E)$ , we denote 2 MST $T,T'$ neighbours if by deleting one edge from $T$ and add another one we get $T'$.
Prove :
for every 2 dis …
- 157