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
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
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 Search options user 137

Questions about properties of and problems on graphs, discrete data structures that have the form of nodes connected by edges, that is networks.

9
votes
No. For example, consider the case where the two sides are disconnected $|E| = 0$ or the case where a large group of nodes are all connected to the same single node: $U = u_1, u_2, ..., u_n$ $V = v_ …
answered Sep 22 '12 by hugomg
3
votes
Seems this question has been bumped by the system because it has no answer yet: The idea JeffE proposed is to reduce the Hamiltonian Path problem (a known NP-complete problem) to this version of the …
answered May 18 '12 by hugomg
28
votes
1answer
There is an easy polynomial algorithm to decide whether there is a path between two nodes in a directed graph (just do a routine graph traversal with, say, depth-first-search). However it seems that, …
asked Mar 15 '12 by hugomg
4
votes
Yes, not deleting the node is the obvious and accepted solution to negative edges. The trick here is that for whatever historical reasons, and as part of a diabolical scheme to better confuse you, we …
answered Jun 24 '12 by hugomg