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 63456
Questions about graphs, discrete structures of nodes which are connected by edges, including trees and graphs with weighted edges.
0
votes
1
answer
40
views
Name of this graph family?
Suppose I start with a directed chain graph of length $n$:
And then I add $k$ edges, with a restriction that the result is a planar DAG:
Is there a name for this graph family?
- 201
0
votes
Maximum planar subgraph problem
See Section 3 in Beyond Planar Graphs presentation by DeMaine. …
- 201
3
votes
0
answers
83
views
Cost of finding optimal elimination order in a planar tensor network?
For planar graphs, the "ratcatcher" algorithm takes $O(n^3)$ time to find elimination order where the slowest step has cost $d^c$ (page 12 of Branch and Tree Decomposition Techniques for
Discrete Optimization …
- 201