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 1785
Questions about graphs, discrete structures of nodes which are connected by edges, including trees and graphs with weighted edges.
3
votes
Is there a mathematical way to deduce that my directed graph is disconnected?
If the multiplicity of zero as an eigenvalue of the Laplacian of your graph is greater than one, your graph is disconnected.
- 2,146
5
votes
Accepted
Transforming an arbitrary cover into a vertex cover
If no points in $C$ lie exactly on the mid-point of an edge in $\mathcal{G}$, then it suffices to associate each point in $C$ to the nearest vertex in $\mathcal{G}$. I will leave it as an exercise to …
- 2,146
2
votes
Accepted
Making a profit as a high-dimensional store owner?
I'm not sure why you would need to enumerate the cliques. You can encode the distance constraints explicitly in just a quadratic number of constraints.
\begin{align*}& &&\max_{S \in \lbrace 0, 1 \rbr …
- 2,146
2
votes
Accepted
Is maximum edge-weighted triangle-free graph NP-hard?
This problem (and other, related problems) are demonstrated to be $NP$-complete in [1]:
If $\pi $ is a property on graphs or digraphs, the edge-deletion problem can be stated as follows: find the minimum …
- 2,146