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 graphs
Search options not deleted
user 105873
Questions about graphs, discrete structures of nodes which are connected by edges, including trees and graphs with weighted edges.
2
votes
1
answer
933
views
What algorithm will tell us how to divide-up a round robin tournament into rounds?
We are designing a tournament for a game such as soccer (football) or chess. The tournament is "round robin." By "round robin," we mean that every team gets to play against each other team exactly onc …
0
votes
0
answers
28
views
Are there any formal grammars describing the set of all directed graphs?
Let GRAPHS be the set of all directed graphs.
Is there a set of strings STRYNGS such that there exists a bijection between
GRAPHS and STRYNGS? … The following two graphs are isomorphic:
( {0, 1, 2} , {(0, 1), (1, 0), (1, 2), (2, 0)} )
( {9, 5, 3} , {(9, 5), (5, 9), (5, 3), (3, 9)} )
STRYNGS need not contain all graphs per se, but …
0
votes
0
answers
111
views
What algorithm will convert a regex into a tree of predictable size?
How do we quantify the size of a regular expression?
A problem in computer science which sometimes arises is converting a regular expression into a tree.
What rules can we use to ensure that the tree …
3
votes
2
answers
906
views
What is a polynomial-time algorithm for determining whether two trees, with colored nodes, a...
Provide any polynomial-time algorithm (even a large degree polynomial) which determines whether two rooted colored trees are isomorphic to each-other or not.
For example, consider the following two t …
1
vote
1
answer
593
views
What algorithm will visit each node in a graph a number of times equal to the number of path...
First Few Iterations of the Algorithm
We have an algorithm in which a squirrel visits the nodes of a directed graph.
Our graph has two colors of edges: black and white.
Initially, the graph has black …
3
votes
3
answers
532
views
For what applications of the traveling salesman problem, does visiting each city at most onc...
Traditionally, the traveling salesman problem has you visit a city at least once and at most once.
However, if you were an actual traveling salesman, you would want the least cost route to visit each …