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 82
Questions about graphs, discrete structures of nodes which are connected by edges, including trees and graphs with weighted edges.
18
votes
Accepted
How hard is counting the number of simple paths between two nodes in a directed graph?
finding (linear) vs. counting all assignments satisfying a DNF formula or an instance of 2-SAT
finding (linear) vs. counting topological sortings
finding (O(VE)) vs. counting perfect matching in bipartite graphs …
- 9,548
2
votes
Accepted
How to quickly find a few bisimulations on a given labelled digraph?
Another thing: deciding if $p\sim q$ implies computing the relation $\sim$ on the union of the directed graphs $G_p=\{x ∣ p \stackrel{a_1\dots a_n}{\longrightarrow}x\}$ and $G_q=\{x ∣ q \stackrel{b_1\dots … If however you know have information like the size of $G_p$ and $G_q$ then you can compute $\sim$ on smaller graphs. …
- 9,548
8
votes
Accepted
The time complexity of finding the diameter of a graph
Here is a counterexample for graphs (diameter is 4, the algorithm returns 3 if you pick this $v$):
If the graph is directed this is rather complex, here is some paper claiming faster results in the dense …
- 9,548
12
votes
1
answer
6k
views
Directed union-find
Consider a directed graph $G$ on which one can dynamically add edges and make some specific queries.
Example: disjoint-set forest
Consider the following set of queries:
arrow(u, v)
equiv(u, v)
find …
- 9,548