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 combinatorial-optimization
Search options not deleted
user 62043
Combinatorial optimization typically deals with optimizing over a finite set of objects that have some combinatorial structure (e.g. trees, matchings, matroids). Approximation algorithms, polyhedral methods, and integer programming are all on topic.
1
vote
Relationship between cycle length, number of chords, and number of induced $P_{4}$ subgraphs...
I agree with
Cycle of length 5 with 0 chords: Number of P4 induced subgraphs: 5
Cycle of length 5 with 1 chord: Number of P4 induced subgraphs: 2
But I'm not sure how to interpret your statement:
C …
- 265
2
votes
Relaxing Meyniel graphs: condition for strongly perfect instead of very strongly perfect
You ask:
Does this mean every induced subgraph of G which are cycles of odd length at least 5 has at least 2 chords?
No, that doesn't make sense. If an induced subgraph is an induced cycle, then it …
- 265