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 19943
Questions about graphs, discrete structures of nodes which are connected by edges, including trees and graphs with weighted edges.
4
votes
1
answer
173
views
Disproving well-quasi-order by providing an infinite anti-chain
More specifically, I've been trying to solve an exercise from the following lecture
which asks whether the class of $P_{3}\text{-free}$ graphs is a w.q.o or not on the induced subgraph operation $\leq … \rbrace$ with $G_{i}$ representing all $P_{3}\text{-free}$ graphs on $i$ vertices (and graphs in $G_{i}$ being represented in a touple-like alpharithmetic form $(a_{1},....,a_{i})$ such that $a_{1 …
- 474
-1
votes
1
answer
144
views
Minimising two maximum edges in s-t path
I've been trying to solve the following problem:
Problem is the following:
Given a graph and a pair of nodes $s$, $t$ you have to find the path from $s$ to $t$ which minimises the sum of its two …
- 474
2
votes
Algorithm for grid with obstacles and movement restriction
You can depict states of the graph as following:
(grid_position,|consecutive_left|,|consecutive_up|)
if you are at state ([2,3],3,0) then you have no other option but to go
up to ([3,3],0,1)
so you …
- 474
7
votes
How to solve an arrangement problem at the Archive Nationale of France using graph theory?
I think I have a solution to your problem. Hopefully I haven't misunderstood something in the definition of your problem. Here it goes:
I'm going to describe a Dynamic Programming approach. It's an …
- 474
4
votes
1
answer
520
views
Maximum bipartite matching with extra reward for covering certain sets
Consider the following variation of Bipartite Maximum Matching. As usual, we have a bipartite graph $G$. In addition, there is an additional collection of sets $S_1,S_2,\dots,S_k$, with each set $S …
- 474