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 40395
Graph theory is the study of graphs, mathematical structures used to model pairwise relations between objects.
1
vote
0
answers
62
views
Planarity testing of directed graph and 3d grid
I wonder if there exist definitions (and known algorithms) of planarity testing for the following case:
1- A directed graph
let $G=(V=\{1,\ldots,n\},E)$ be a directed graph.
Assume $e_{ij} =(v_i,v …
- 271
0
votes
2
answers
396
views
Efficient algorithm for testing planarity of the union of two planar graphs
Let $G_1 = (V,E_1)$ and $G_2 = (V,E_2)$ both be planar graphs.
Is there an efficient algorithm to check whether the union $G = (V,E_1\cup E_2)$ is planar?
That is, an algorithm more efficient than t …
- 271
2
votes
0
answers
82
views
What can i learn about a graph about which only certain properties are known [closed]
1) Suppose we are given the following facts about a graph. What can we conclude/compute beyond these facts?
The fact that graph $G(V,E)$ is planar, and thus that it is 4-colorable,
The degree of eac …
- 271
2
votes
1
answer
557
views
Graph planarity testing via adjacency matrix
I have looked at several efficient graph planarity algorithms which
rely on computing and traversing DFS trees
(that add one vertex/edge/path at a time).
I am looking for graph planarity algorithms …
- 271