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 graph-theory
Search options not deleted
user 917
A field of combinatorics relating to the study of vertices and the edges that connect them
0
votes
1
answer
103
views
Unique Partition of a Graph
Given an undirected graph, is it possible to find a criteria that leads to a unique partition of the nodes? The graph is not weighted.
- 585
2
votes
1
answer
156
views
k-splittable flow problem
The maximum k-splittable s-t flow problem(MkSF) that aims to find a maximum k-splittable flow between a given source and sink node is NP-hard. We do not require the paths to be disjoint, not even diff …
- 585
1
vote
k-splittable flow problem
The answer of the the first part is yes; restricting the paths to be disjoint makes still the problem NP-hard.
Based on the Menger theorem, the number of disjoint paths between two given nodes is the …
- 585