Questions tagged [independent-set]
32 questions
1
vote
1 answer
Prove NP-completeness of CLIQUE-OR-INDEPENDENT-SET
First of all, I want to mention that this is my homework. However, to solve my problem I can use any literature I want.
Even though I think that problem is clear from its name, I will give it description: "For given undirected graph G and given…

sruzic
- 125
- 12
1
vote
1 answer
What's the best way to optimally match rated pairs?
Lets says I have a list of men and women. Each man(x) rates each woman, and each woman(y) rates each man, on a scale 0-9.
e.g.
x1: {y1: 0, y2: 5, y3: 9}
x2: {y1: 1, y2: 0, y3: 9}
x3: {y1: 5, y2: 5, y3: 8}
y1: {x1: 3, x2: 3, x3: 5}
y2: {x1: 8, x2:…

Kieron George
- 11
- 1
1
vote
1 answer
Algorithm to generate all independent sets of an undirected graph?
We need an algorithm to generate all independent sets of an undirected graph.
For example:
We tried to use 'Bron-Kerbosch' algorithm, but do not understand how to interpret the result.
Input:
A = [1 2; 1 5; 2 3; 2 5; 3 4; 4 5; 4 6]
Desired…

Community Driven Business
- 4,622
- 1
- 16
- 20
0
votes
0 answers
How can I prove the unction of 3 events A1,A2,A3, if P(A2 U A3)=0
a) Suppose A1,A2,A3 are events such that P(A1 ∩ A2) = P(A1 ∩ A3)!= 0 while P(A2 ∩ A3) = 0. Calculate the probability that at least one of these events occurs by calculating
P(A1 ∪ A2 ∪ A3) in terms of only P(A1),P(A2),P(A3) and P(A1 ∩ A2).
b) If A1,…

Tryingtolearn
- 13
- 3
0
votes
0 answers
Understanding Reductions to show NP-Completeness
I have a homework problem that I am finding difficult to begin. We are working on Karp (single-call) reductions to show intractability. For this assignment, the problem is intentionally vague. I was hoping someone here may know it or can provide an…

enarm4
- 1
- 1
0
votes
0 answers
How do you compare samples if they are not Independent and Identical Distributed (IID)?
I have 2 questions.
Nr. 1: I have a simulation model running for 1 year (after the warm-up period) that simulates the patients coming into a clinic for their treatment (set up daily) (a patient may come in for their treatment once every week for the…

Alex W.
- 21
- 4
0
votes
1 answer
Check the least number of colors needed to color graph (chromatic number in 2-regular graph)
My task is to check the least number of colors used in graph coloring which is simply chromatic number of graph. My undirected graph is 2-regular (each vertex is 2-degree). I found solution that
(maximum independent set number)/number of vertices =…

Mark
- 79
- 2
- 9
0
votes
0 answers
Correlation between Independent Set and Matching
Assume we have an undirected Graph G = (V,E) and we construct a new Graph G' where two nodes are adjacent if they have a common neighbor node in G.
Can someone explain why the following statements are true if we have such a construction G'?
If G has…

Marc
- 191
- 1
- 1
- 9
0
votes
2 answers
Finding all independent sets of a perfect graph
I read that a maximum independent set on a perfect graph can be found in polynomial time.
Is there any polynomial time algorithm that can find the list of all independent sets of a perfect graph?

user2858924
- 433
- 5
- 15
0
votes
1 answer
Time complexity of Maximum independent Set Algorithm
I am learning how to find out the time complexity of the Maximum Independent Set problem using branch and reduce method. The following is the calculation copied from the textbook.
Here I am unable to find out how the red box marked line came from…

user5411115
- 101
- 1
- 9
0
votes
1 answer
Matroid, Unique Circuit Property
For the uniqueness of circuit in matroid, refers to this note:
http://math.mit.edu/~goemans/18433S13/matroid-notes.pdf. In the proof of Theorem 4.1, the last 2 sentences " Since S is also independent, we must have that |X| = |S| and since e ∈ C1 −…

jy l
- 25
- 1
- 8
0
votes
1 answer
Max Independent Set in Prolog
I am trying to implement a Prolog predicate that gets a binary tree (represented as t(Left, Root, Right)) and returns a list that is the Maximal Independent Set (MIS) of this tree, and its size.
I first understood that MIS(T) is the maximum between…

avish12
- 107
- 8
0
votes
1 answer
Difference between line, branch and independent path coverage?
What is the difference between line, branch and independent path coverage?
given the following scenario, how the paths will look like?
Image for control flow graph on the following link --> http://testerstories.com/files/Path.Test.011.png
Steps for…

Engineering Mind
- 113
- 3
- 12
0
votes
2 answers
How to INTERSECT two columns in SQL Server
I have my data table AC in SQL Server with structure as:
+----------+------------+-------+
| AuthorID | CoAuthorID | Year |
+----------+------------+-------+
| 677 | 901706 | 2005 |
| 677 | 901706 | 2005 |
| 677 | 901706 …

maliks
- 1,102
- 3
- 18
- 42
0
votes
2 answers
Creating an independent set from a graph in Alloy 4.2
I've created a test graph to try and create an independent set from. I know and independent set is a set of vertices that aren't connected, but I'm not sure how to accomplish this in alloy 4.2. Here's what I have:
abstract sig Vertex {
e: set…

Raviga
- 117
- 1
- 16