The Clique vs. Independent Set Problem












3












$begingroup$


Suppose you have an undirected graph $G = (V, E)$, known to both Alice and Bob, Alice gets an independent set of $G$. Bob gets a Clique $B ⊆ V$.



Is there any algorithm in $O(log^2 n)$ bits that finds whether
$ A ∩ B = Ø $?



This is a well known communication complexity problem called CIS problem that was described by Yannakakis.





  • Lecture notes; the claim is Theorem 3

  • Link to Nisan & Kushilevitz's textbook


I'm not sure why and how does this work exactly. and which part of the $n/2$ vertices are reduced by both players.



P.S. I came to a conclusion that an independent and a clique can intersect in at most one vertex.










share|cite|improve this question











$endgroup$












  • $begingroup$
    The lecture notes contain a complete proof.
    $endgroup$
    – Yuval Filmus
    2 days ago










  • $begingroup$
    I did not understand the algorithm completely to understand the proof itself.
    $endgroup$
    – Jay
    2 days ago
















3












$begingroup$


Suppose you have an undirected graph $G = (V, E)$, known to both Alice and Bob, Alice gets an independent set of $G$. Bob gets a Clique $B ⊆ V$.



Is there any algorithm in $O(log^2 n)$ bits that finds whether
$ A ∩ B = Ø $?



This is a well known communication complexity problem called CIS problem that was described by Yannakakis.





  • Lecture notes; the claim is Theorem 3

  • Link to Nisan & Kushilevitz's textbook


I'm not sure why and how does this work exactly. and which part of the $n/2$ vertices are reduced by both players.



P.S. I came to a conclusion that an independent and a clique can intersect in at most one vertex.










share|cite|improve this question











$endgroup$












  • $begingroup$
    The lecture notes contain a complete proof.
    $endgroup$
    – Yuval Filmus
    2 days ago










  • $begingroup$
    I did not understand the algorithm completely to understand the proof itself.
    $endgroup$
    – Jay
    2 days ago














3












3








3





$begingroup$


Suppose you have an undirected graph $G = (V, E)$, known to both Alice and Bob, Alice gets an independent set of $G$. Bob gets a Clique $B ⊆ V$.



Is there any algorithm in $O(log^2 n)$ bits that finds whether
$ A ∩ B = Ø $?



This is a well known communication complexity problem called CIS problem that was described by Yannakakis.





  • Lecture notes; the claim is Theorem 3

  • Link to Nisan & Kushilevitz's textbook


I'm not sure why and how does this work exactly. and which part of the $n/2$ vertices are reduced by both players.



P.S. I came to a conclusion that an independent and a clique can intersect in at most one vertex.










share|cite|improve this question











$endgroup$




Suppose you have an undirected graph $G = (V, E)$, known to both Alice and Bob, Alice gets an independent set of $G$. Bob gets a Clique $B ⊆ V$.



Is there any algorithm in $O(log^2 n)$ bits that finds whether
$ A ∩ B = Ø $?



This is a well known communication complexity problem called CIS problem that was described by Yannakakis.





  • Lecture notes; the claim is Theorem 3

  • Link to Nisan & Kushilevitz's textbook


I'm not sure why and how does this work exactly. and which part of the $n/2$ vertices are reduced by both players.



P.S. I came to a conclusion that an independent and a clique can intersect in at most one vertex.







algorithms graphs communication-complexity






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 2 days ago









Yuval Filmus

196k15184349




196k15184349










asked 2 days ago









JayJay

1465




1465












  • $begingroup$
    The lecture notes contain a complete proof.
    $endgroup$
    – Yuval Filmus
    2 days ago










  • $begingroup$
    I did not understand the algorithm completely to understand the proof itself.
    $endgroup$
    – Jay
    2 days ago


















  • $begingroup$
    The lecture notes contain a complete proof.
    $endgroup$
    – Yuval Filmus
    2 days ago










  • $begingroup$
    I did not understand the algorithm completely to understand the proof itself.
    $endgroup$
    – Jay
    2 days ago
















$begingroup$
The lecture notes contain a complete proof.
$endgroup$
– Yuval Filmus
2 days ago




$begingroup$
The lecture notes contain a complete proof.
$endgroup$
– Yuval Filmus
2 days ago












$begingroup$
I did not understand the algorithm completely to understand the proof itself.
$endgroup$
– Jay
2 days ago




$begingroup$
I did not understand the algorithm completely to understand the proof itself.
$endgroup$
– Jay
2 days ago










2 Answers
2






active

oldest

votes


















5












$begingroup$

The two players construct a sequence $V_0 supset V_1 supset cdots supset V_m$ of sets of vertices such that:





  1. $V_0$ consists of all vertices in the graph.


  2. $|V_{i+1}| leq (|V_i|+1)/2$.


  3. $V_i supseteq C cap I$.


The players stop once $|V_m| leq 1$. At this point they can answer the question using $O(1)$ communication.



At round $i$, the players know $V_{i-1}$, and wish to construct $V_i$. They act as follows:




  • If $C cap V_{i-1}$ contains a vertex $v$ with fewer than $|V_{i-1}|/2$ neighbors in $V_{i-1}$, then Alice sends Bob one such vertex $v$, and both players set $V_i$ to be this set of neighbors, together with $v$ (this is valid since $C cap I subseteq C subseteq V_i$). Otherwise, she sends $bot$.


  • If Alice sent $bot$ and $I cap V_{i-1}$ contains a vertex $v$ with fewer than $|V_{i-1}|/2$ non-neighbors in $V_{i-1}$, then Bob sends Alice one such vertex $v$, and both players set $V_i$ to be this set of non-neighbors, together with $v$ (this is valid since $C cap I subseteq I subseteq V_i$). Otherwise, he sends Alice $bot$.


  • If both players sent $bot$, then $C cap I = emptyset$. Indeed, if $v in C cap I$, then $v$ has at least $|V_{i-1}|/2$ neighbors and at least $|V_{i-1}|/2$ non-neighbors inside $|V_{i-1}|$, whereas the number of potential neighbors and non-neighbors is just $|V_{i-1}|-1$. Therefore the players can abort and conclude that $C cap I = emptyset$.



Each round takes $O(log n)$ bits of communication, and there are $O(log n)$ rounds, for a total of $O(log^2 n)$ bits of communication.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    How does the number of vertices are resuced by factor of 2 - this leads to the $O(log(n))$ rounds?
    $endgroup$
    – Jay
    2 days ago












  • $begingroup$
    I'm sorry, I can't explain it any better than what I wrote.
    $endgroup$
    – Yuval Filmus
    2 days ago










  • $begingroup$
    Thanks a lot Yuval, I’ll try to figure it out.
    $endgroup$
    – Jay
    2 days ago



















3












$begingroup$

The $O(log n)$ rounds comes from the fact that we are doing a binary search:



If the algorithm fails to terminate, then either Alice or Bob share a vertex v.



If Alice shares $v$, then $v$ has fewer than $|V_{i-1}|/2$ neighbors in $V_{i-1}$. $V_i$ is set to be this neighborhood (along with v). Observe that $|V_i|< |V_{i-1}|/2+1$. We will be a little hand-wavy and say $|V_i|leq |V_{i-1}|/2$ (although it may actually be $|V_{i-1}|/2+1/2$ when $|V_{i-1}|$ is odd).



Similarly, if Bob shares $v$, then $v$ has fewer than $|V_{i-1}|/2$ non-neighbors in $V_{i-1}$. $V_i$ is set to be this non-neighborhood (along with v). As such, $|V_i|leq |V_{i-1}|/2$ (again we are being a little hand-wavy).



In both cases $|V_i|leq |V_{i-1}|/2$. As such, if the algorithm fails to terminate after $k$ iterations, then, inductively, $|V_k|leq |V_0|/2^k$. Finally, observe that the algorithm terminates if $|V_k|leq 1$, i.e., we will terminate if ever $V_k$ is a singleton or empty. Finally, $|V_k|leq |V_0|/2^kleq 1$ if $kgeq log |V_0|=log n$ implying that we must terminate in $log n$ iterations.






share|cite|improve this answer










New contributor




James Bailey is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






$endgroup$









  • 1




    $begingroup$
    If $|V_{i-1}|$ is odd then your inequality is off by 1/2.
    $endgroup$
    – Yuval Filmus
    2 days ago










  • $begingroup$
    Correct. Resolving the issue of parity results in at most $1+log n$ rounds.
    $endgroup$
    – James Bailey
    2 days ago














Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "419"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f106562%2fthe-clique-vs-independent-set-problem%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























2 Answers
2






active

oldest

votes








2 Answers
2






active

oldest

votes









active

oldest

votes






active

oldest

votes









5












$begingroup$

The two players construct a sequence $V_0 supset V_1 supset cdots supset V_m$ of sets of vertices such that:





  1. $V_0$ consists of all vertices in the graph.


  2. $|V_{i+1}| leq (|V_i|+1)/2$.


  3. $V_i supseteq C cap I$.


The players stop once $|V_m| leq 1$. At this point they can answer the question using $O(1)$ communication.



At round $i$, the players know $V_{i-1}$, and wish to construct $V_i$. They act as follows:




  • If $C cap V_{i-1}$ contains a vertex $v$ with fewer than $|V_{i-1}|/2$ neighbors in $V_{i-1}$, then Alice sends Bob one such vertex $v$, and both players set $V_i$ to be this set of neighbors, together with $v$ (this is valid since $C cap I subseteq C subseteq V_i$). Otherwise, she sends $bot$.


  • If Alice sent $bot$ and $I cap V_{i-1}$ contains a vertex $v$ with fewer than $|V_{i-1}|/2$ non-neighbors in $V_{i-1}$, then Bob sends Alice one such vertex $v$, and both players set $V_i$ to be this set of non-neighbors, together with $v$ (this is valid since $C cap I subseteq I subseteq V_i$). Otherwise, he sends Alice $bot$.


  • If both players sent $bot$, then $C cap I = emptyset$. Indeed, if $v in C cap I$, then $v$ has at least $|V_{i-1}|/2$ neighbors and at least $|V_{i-1}|/2$ non-neighbors inside $|V_{i-1}|$, whereas the number of potential neighbors and non-neighbors is just $|V_{i-1}|-1$. Therefore the players can abort and conclude that $C cap I = emptyset$.



Each round takes $O(log n)$ bits of communication, and there are $O(log n)$ rounds, for a total of $O(log^2 n)$ bits of communication.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    How does the number of vertices are resuced by factor of 2 - this leads to the $O(log(n))$ rounds?
    $endgroup$
    – Jay
    2 days ago












  • $begingroup$
    I'm sorry, I can't explain it any better than what I wrote.
    $endgroup$
    – Yuval Filmus
    2 days ago










  • $begingroup$
    Thanks a lot Yuval, I’ll try to figure it out.
    $endgroup$
    – Jay
    2 days ago
















5












$begingroup$

The two players construct a sequence $V_0 supset V_1 supset cdots supset V_m$ of sets of vertices such that:





  1. $V_0$ consists of all vertices in the graph.


  2. $|V_{i+1}| leq (|V_i|+1)/2$.


  3. $V_i supseteq C cap I$.


The players stop once $|V_m| leq 1$. At this point they can answer the question using $O(1)$ communication.



At round $i$, the players know $V_{i-1}$, and wish to construct $V_i$. They act as follows:




  • If $C cap V_{i-1}$ contains a vertex $v$ with fewer than $|V_{i-1}|/2$ neighbors in $V_{i-1}$, then Alice sends Bob one such vertex $v$, and both players set $V_i$ to be this set of neighbors, together with $v$ (this is valid since $C cap I subseteq C subseteq V_i$). Otherwise, she sends $bot$.


  • If Alice sent $bot$ and $I cap V_{i-1}$ contains a vertex $v$ with fewer than $|V_{i-1}|/2$ non-neighbors in $V_{i-1}$, then Bob sends Alice one such vertex $v$, and both players set $V_i$ to be this set of non-neighbors, together with $v$ (this is valid since $C cap I subseteq I subseteq V_i$). Otherwise, he sends Alice $bot$.


  • If both players sent $bot$, then $C cap I = emptyset$. Indeed, if $v in C cap I$, then $v$ has at least $|V_{i-1}|/2$ neighbors and at least $|V_{i-1}|/2$ non-neighbors inside $|V_{i-1}|$, whereas the number of potential neighbors and non-neighbors is just $|V_{i-1}|-1$. Therefore the players can abort and conclude that $C cap I = emptyset$.



Each round takes $O(log n)$ bits of communication, and there are $O(log n)$ rounds, for a total of $O(log^2 n)$ bits of communication.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    How does the number of vertices are resuced by factor of 2 - this leads to the $O(log(n))$ rounds?
    $endgroup$
    – Jay
    2 days ago












  • $begingroup$
    I'm sorry, I can't explain it any better than what I wrote.
    $endgroup$
    – Yuval Filmus
    2 days ago










  • $begingroup$
    Thanks a lot Yuval, I’ll try to figure it out.
    $endgroup$
    – Jay
    2 days ago














5












5








5





$begingroup$

The two players construct a sequence $V_0 supset V_1 supset cdots supset V_m$ of sets of vertices such that:





  1. $V_0$ consists of all vertices in the graph.


  2. $|V_{i+1}| leq (|V_i|+1)/2$.


  3. $V_i supseteq C cap I$.


The players stop once $|V_m| leq 1$. At this point they can answer the question using $O(1)$ communication.



At round $i$, the players know $V_{i-1}$, and wish to construct $V_i$. They act as follows:




  • If $C cap V_{i-1}$ contains a vertex $v$ with fewer than $|V_{i-1}|/2$ neighbors in $V_{i-1}$, then Alice sends Bob one such vertex $v$, and both players set $V_i$ to be this set of neighbors, together with $v$ (this is valid since $C cap I subseteq C subseteq V_i$). Otherwise, she sends $bot$.


  • If Alice sent $bot$ and $I cap V_{i-1}$ contains a vertex $v$ with fewer than $|V_{i-1}|/2$ non-neighbors in $V_{i-1}$, then Bob sends Alice one such vertex $v$, and both players set $V_i$ to be this set of non-neighbors, together with $v$ (this is valid since $C cap I subseteq I subseteq V_i$). Otherwise, he sends Alice $bot$.


  • If both players sent $bot$, then $C cap I = emptyset$. Indeed, if $v in C cap I$, then $v$ has at least $|V_{i-1}|/2$ neighbors and at least $|V_{i-1}|/2$ non-neighbors inside $|V_{i-1}|$, whereas the number of potential neighbors and non-neighbors is just $|V_{i-1}|-1$. Therefore the players can abort and conclude that $C cap I = emptyset$.



Each round takes $O(log n)$ bits of communication, and there are $O(log n)$ rounds, for a total of $O(log^2 n)$ bits of communication.






share|cite|improve this answer











$endgroup$



The two players construct a sequence $V_0 supset V_1 supset cdots supset V_m$ of sets of vertices such that:





  1. $V_0$ consists of all vertices in the graph.


  2. $|V_{i+1}| leq (|V_i|+1)/2$.


  3. $V_i supseteq C cap I$.


The players stop once $|V_m| leq 1$. At this point they can answer the question using $O(1)$ communication.



At round $i$, the players know $V_{i-1}$, and wish to construct $V_i$. They act as follows:




  • If $C cap V_{i-1}$ contains a vertex $v$ with fewer than $|V_{i-1}|/2$ neighbors in $V_{i-1}$, then Alice sends Bob one such vertex $v$, and both players set $V_i$ to be this set of neighbors, together with $v$ (this is valid since $C cap I subseteq C subseteq V_i$). Otherwise, she sends $bot$.


  • If Alice sent $bot$ and $I cap V_{i-1}$ contains a vertex $v$ with fewer than $|V_{i-1}|/2$ non-neighbors in $V_{i-1}$, then Bob sends Alice one such vertex $v$, and both players set $V_i$ to be this set of non-neighbors, together with $v$ (this is valid since $C cap I subseteq I subseteq V_i$). Otherwise, he sends Alice $bot$.


  • If both players sent $bot$, then $C cap I = emptyset$. Indeed, if $v in C cap I$, then $v$ has at least $|V_{i-1}|/2$ neighbors and at least $|V_{i-1}|/2$ non-neighbors inside $|V_{i-1}|$, whereas the number of potential neighbors and non-neighbors is just $|V_{i-1}|-1$. Therefore the players can abort and conclude that $C cap I = emptyset$.



Each round takes $O(log n)$ bits of communication, and there are $O(log n)$ rounds, for a total of $O(log^2 n)$ bits of communication.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited 2 days ago

























answered 2 days ago









Yuval FilmusYuval Filmus

196k15184349




196k15184349












  • $begingroup$
    How does the number of vertices are resuced by factor of 2 - this leads to the $O(log(n))$ rounds?
    $endgroup$
    – Jay
    2 days ago












  • $begingroup$
    I'm sorry, I can't explain it any better than what I wrote.
    $endgroup$
    – Yuval Filmus
    2 days ago










  • $begingroup$
    Thanks a lot Yuval, I’ll try to figure it out.
    $endgroup$
    – Jay
    2 days ago


















  • $begingroup$
    How does the number of vertices are resuced by factor of 2 - this leads to the $O(log(n))$ rounds?
    $endgroup$
    – Jay
    2 days ago












  • $begingroup$
    I'm sorry, I can't explain it any better than what I wrote.
    $endgroup$
    – Yuval Filmus
    2 days ago










  • $begingroup$
    Thanks a lot Yuval, I’ll try to figure it out.
    $endgroup$
    – Jay
    2 days ago
















$begingroup$
How does the number of vertices are resuced by factor of 2 - this leads to the $O(log(n))$ rounds?
$endgroup$
– Jay
2 days ago






$begingroup$
How does the number of vertices are resuced by factor of 2 - this leads to the $O(log(n))$ rounds?
$endgroup$
– Jay
2 days ago














$begingroup$
I'm sorry, I can't explain it any better than what I wrote.
$endgroup$
– Yuval Filmus
2 days ago




$begingroup$
I'm sorry, I can't explain it any better than what I wrote.
$endgroup$
– Yuval Filmus
2 days ago












$begingroup$
Thanks a lot Yuval, I’ll try to figure it out.
$endgroup$
– Jay
2 days ago




$begingroup$
Thanks a lot Yuval, I’ll try to figure it out.
$endgroup$
– Jay
2 days ago











3












$begingroup$

The $O(log n)$ rounds comes from the fact that we are doing a binary search:



If the algorithm fails to terminate, then either Alice or Bob share a vertex v.



If Alice shares $v$, then $v$ has fewer than $|V_{i-1}|/2$ neighbors in $V_{i-1}$. $V_i$ is set to be this neighborhood (along with v). Observe that $|V_i|< |V_{i-1}|/2+1$. We will be a little hand-wavy and say $|V_i|leq |V_{i-1}|/2$ (although it may actually be $|V_{i-1}|/2+1/2$ when $|V_{i-1}|$ is odd).



Similarly, if Bob shares $v$, then $v$ has fewer than $|V_{i-1}|/2$ non-neighbors in $V_{i-1}$. $V_i$ is set to be this non-neighborhood (along with v). As such, $|V_i|leq |V_{i-1}|/2$ (again we are being a little hand-wavy).



In both cases $|V_i|leq |V_{i-1}|/2$. As such, if the algorithm fails to terminate after $k$ iterations, then, inductively, $|V_k|leq |V_0|/2^k$. Finally, observe that the algorithm terminates if $|V_k|leq 1$, i.e., we will terminate if ever $V_k$ is a singleton or empty. Finally, $|V_k|leq |V_0|/2^kleq 1$ if $kgeq log |V_0|=log n$ implying that we must terminate in $log n$ iterations.






share|cite|improve this answer










New contributor




James Bailey is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






$endgroup$









  • 1




    $begingroup$
    If $|V_{i-1}|$ is odd then your inequality is off by 1/2.
    $endgroup$
    – Yuval Filmus
    2 days ago










  • $begingroup$
    Correct. Resolving the issue of parity results in at most $1+log n$ rounds.
    $endgroup$
    – James Bailey
    2 days ago


















3












$begingroup$

The $O(log n)$ rounds comes from the fact that we are doing a binary search:



If the algorithm fails to terminate, then either Alice or Bob share a vertex v.



If Alice shares $v$, then $v$ has fewer than $|V_{i-1}|/2$ neighbors in $V_{i-1}$. $V_i$ is set to be this neighborhood (along with v). Observe that $|V_i|< |V_{i-1}|/2+1$. We will be a little hand-wavy and say $|V_i|leq |V_{i-1}|/2$ (although it may actually be $|V_{i-1}|/2+1/2$ when $|V_{i-1}|$ is odd).



Similarly, if Bob shares $v$, then $v$ has fewer than $|V_{i-1}|/2$ non-neighbors in $V_{i-1}$. $V_i$ is set to be this non-neighborhood (along with v). As such, $|V_i|leq |V_{i-1}|/2$ (again we are being a little hand-wavy).



In both cases $|V_i|leq |V_{i-1}|/2$. As such, if the algorithm fails to terminate after $k$ iterations, then, inductively, $|V_k|leq |V_0|/2^k$. Finally, observe that the algorithm terminates if $|V_k|leq 1$, i.e., we will terminate if ever $V_k$ is a singleton or empty. Finally, $|V_k|leq |V_0|/2^kleq 1$ if $kgeq log |V_0|=log n$ implying that we must terminate in $log n$ iterations.






share|cite|improve this answer










New contributor




James Bailey is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






$endgroup$









  • 1




    $begingroup$
    If $|V_{i-1}|$ is odd then your inequality is off by 1/2.
    $endgroup$
    – Yuval Filmus
    2 days ago










  • $begingroup$
    Correct. Resolving the issue of parity results in at most $1+log n$ rounds.
    $endgroup$
    – James Bailey
    2 days ago
















3












3








3





$begingroup$

The $O(log n)$ rounds comes from the fact that we are doing a binary search:



If the algorithm fails to terminate, then either Alice or Bob share a vertex v.



If Alice shares $v$, then $v$ has fewer than $|V_{i-1}|/2$ neighbors in $V_{i-1}$. $V_i$ is set to be this neighborhood (along with v). Observe that $|V_i|< |V_{i-1}|/2+1$. We will be a little hand-wavy and say $|V_i|leq |V_{i-1}|/2$ (although it may actually be $|V_{i-1}|/2+1/2$ when $|V_{i-1}|$ is odd).



Similarly, if Bob shares $v$, then $v$ has fewer than $|V_{i-1}|/2$ non-neighbors in $V_{i-1}$. $V_i$ is set to be this non-neighborhood (along with v). As such, $|V_i|leq |V_{i-1}|/2$ (again we are being a little hand-wavy).



In both cases $|V_i|leq |V_{i-1}|/2$. As such, if the algorithm fails to terminate after $k$ iterations, then, inductively, $|V_k|leq |V_0|/2^k$. Finally, observe that the algorithm terminates if $|V_k|leq 1$, i.e., we will terminate if ever $V_k$ is a singleton or empty. Finally, $|V_k|leq |V_0|/2^kleq 1$ if $kgeq log |V_0|=log n$ implying that we must terminate in $log n$ iterations.






share|cite|improve this answer










New contributor




James Bailey is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






$endgroup$



The $O(log n)$ rounds comes from the fact that we are doing a binary search:



If the algorithm fails to terminate, then either Alice or Bob share a vertex v.



If Alice shares $v$, then $v$ has fewer than $|V_{i-1}|/2$ neighbors in $V_{i-1}$. $V_i$ is set to be this neighborhood (along with v). Observe that $|V_i|< |V_{i-1}|/2+1$. We will be a little hand-wavy and say $|V_i|leq |V_{i-1}|/2$ (although it may actually be $|V_{i-1}|/2+1/2$ when $|V_{i-1}|$ is odd).



Similarly, if Bob shares $v$, then $v$ has fewer than $|V_{i-1}|/2$ non-neighbors in $V_{i-1}$. $V_i$ is set to be this non-neighborhood (along with v). As such, $|V_i|leq |V_{i-1}|/2$ (again we are being a little hand-wavy).



In both cases $|V_i|leq |V_{i-1}|/2$. As such, if the algorithm fails to terminate after $k$ iterations, then, inductively, $|V_k|leq |V_0|/2^k$. Finally, observe that the algorithm terminates if $|V_k|leq 1$, i.e., we will terminate if ever $V_k$ is a singleton or empty. Finally, $|V_k|leq |V_0|/2^kleq 1$ if $kgeq log |V_0|=log n$ implying that we must terminate in $log n$ iterations.







share|cite|improve this answer










New contributor




James Bailey is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this answer



share|cite|improve this answer








edited yesterday





















New contributor




James Bailey is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









answered 2 days ago









James BaileyJames Bailey

312




312




New contributor




James Bailey is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





James Bailey is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






James Bailey is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.








  • 1




    $begingroup$
    If $|V_{i-1}|$ is odd then your inequality is off by 1/2.
    $endgroup$
    – Yuval Filmus
    2 days ago










  • $begingroup$
    Correct. Resolving the issue of parity results in at most $1+log n$ rounds.
    $endgroup$
    – James Bailey
    2 days ago
















  • 1




    $begingroup$
    If $|V_{i-1}|$ is odd then your inequality is off by 1/2.
    $endgroup$
    – Yuval Filmus
    2 days ago










  • $begingroup$
    Correct. Resolving the issue of parity results in at most $1+log n$ rounds.
    $endgroup$
    – James Bailey
    2 days ago










1




1




$begingroup$
If $|V_{i-1}|$ is odd then your inequality is off by 1/2.
$endgroup$
– Yuval Filmus
2 days ago




$begingroup$
If $|V_{i-1}|$ is odd then your inequality is off by 1/2.
$endgroup$
– Yuval Filmus
2 days ago












$begingroup$
Correct. Resolving the issue of parity results in at most $1+log n$ rounds.
$endgroup$
– James Bailey
2 days ago






$begingroup$
Correct. Resolving the issue of parity results in at most $1+log n$ rounds.
$endgroup$
– James Bailey
2 days ago




















draft saved

draft discarded




















































Thanks for contributing an answer to Computer Science Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f106562%2fthe-clique-vs-independent-set-problem%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Færeyskur hestur Heimild | Tengill | Tilvísanir | LeiðsagnarvalRossið - síða um færeyska hrossið á færeyskuGott ár hjá færeyska hestinum

He _____ here since 1970 . Answer needed [closed]What does “since he was so high” mean?Meaning of “catch birds for”?How do I ensure “since” takes the meaning I want?“Who cares here” meaningWhat does “right round toward” mean?the time tense (had now been detected)What does the phrase “ring around the roses” mean here?Correct usage of “visited upon”Meaning of “foiled rail sabotage bid”It was the third time I had gone to Rome or It is the third time I had been to Rome

Slayer Innehåll Historia | Stil, komposition och lyrik | Bandets betydelse och framgångar | Sidoprojekt och samarbeten | Kontroverser | Medlemmar | Utmärkelser och nomineringar | Turnéer och festivaler | Diskografi | Referenser | Externa länkar | Navigeringsmenywww.slayer.net”Metal Massacre vol. 1””Metal Massacre vol. 3””Metal Massacre Volume III””Show No Mercy””Haunting the Chapel””Live Undead””Hell Awaits””Reign in Blood””Reign in Blood””Gold & Platinum – Reign in Blood””Golden Gods Awards Winners”originalet”Kerrang! Hall Of Fame””Slayer Looks Back On 37-Year Career In New Video Series: Part Two””South of Heaven””Gold & Platinum – South of Heaven””Seasons in the Abyss””Gold & Platinum - Seasons in the Abyss””Divine Intervention””Divine Intervention - Release group by Slayer””Gold & Platinum - Divine Intervention””Live Intrusion””Undisputed Attitude””Abolish Government/Superficial Love””Release “Slatanic Slaughter: A Tribute to Slayer” by Various Artists””Diabolus in Musica””Soundtrack to the Apocalypse””God Hates Us All””Systematic - Relationships””War at the Warfield””Gold & Platinum - War at the Warfield””Soundtrack to the Apocalypse””Gold & Platinum - Still Reigning””Metallica, Slayer, Iron Mauden Among Winners At Metal Hammer Awards””Eternal Pyre””Eternal Pyre - Slayer release group””Eternal Pyre””Metal Storm Awards 2006””Kerrang! Hall Of Fame””Slayer Wins 'Best Metal' Grammy Award””Slayer Guitarist Jeff Hanneman Dies””Bullet-For My Valentine booed at Metal Hammer Golden Gods Awards””Unholy Aliance””The End Of Slayer?””Slayer: We Could Thrash Out Two More Albums If We're Fast Enough...””'The Unholy Alliance: Chapter III' UK Dates Added”originalet”Megadeth And Slayer To Co-Headline 'Canadian Carnage' Trek”originalet”World Painted Blood””Release “World Painted Blood” by Slayer””Metallica Heading To Cinemas””Slayer, Megadeth To Join Forces For 'European Carnage' Tour - Dec. 18, 2010”originalet”Slayer's Hanneman Contracts Acute Infection; Band To Bring In Guest Guitarist””Cannibal Corpse's Pat O'Brien Will Step In As Slayer's Guest Guitarist”originalet”Slayer’s Jeff Hanneman Dead at 49””Dave Lombardo Says He Made Only $67,000 In 2011 While Touring With Slayer””Slayer: We Do Not Agree With Dave Lombardo's Substance Or Timeline Of Events””Slayer Welcomes Drummer Paul Bostaph Back To The Fold””Slayer Hope to Unveil Never-Before-Heard Jeff Hanneman Material on Next Album””Slayer Debut New Song 'Implode' During Surprise Golden Gods Appearance””Release group Repentless by Slayer””Repentless - Slayer - Credits””Slayer””Metal Storm Awards 2015””Slayer - to release comic book "Repentless #1"””Slayer To Release 'Repentless' 6.66" Vinyl Box Set””BREAKING NEWS: Slayer Announce Farewell Tour””Slayer Recruit Lamb of God, Anthrax, Behemoth + Testament for Final Tour””Slayer lägger ner efter 37 år””Slayer Announces Second North American Leg Of 'Final' Tour””Final World Tour””Slayer Announces Final European Tour With Lamb of God, Anthrax And Obituary””Slayer To Tour Europe With Lamb of God, Anthrax And Obituary””Slayer To Play 'Last French Show Ever' At Next Year's Hellfst””Slayer's Final World Tour Will Extend Into 2019””Death Angel's Rob Cavestany On Slayer's 'Farewell' Tour: 'Some Of Us Could See This Coming'””Testament Has No Plans To Retire Anytime Soon, Says Chuck Billy””Anthrax's Scott Ian On Slayer's 'Farewell' Tour Plans: 'I Was Surprised And I Wasn't Surprised'””Slayer””Slayer's Morbid Schlock””Review/Rock; For Slayer, the Mania Is the Message””Slayer - Biography””Slayer - Reign In Blood”originalet”Dave Lombardo””An exclusive oral history of Slayer”originalet”Exclusive! Interview With Slayer Guitarist Jeff Hanneman”originalet”Thinking Out Loud: Slayer's Kerry King on hair metal, Satan and being polite””Slayer Lyrics””Slayer - Biography””Most influential artists for extreme metal music””Slayer - Reign in Blood””Slayer guitarist Jeff Hanneman dies aged 49””Slatanic Slaughter: A Tribute to Slayer””Gateway to Hell: A Tribute to Slayer””Covered In Blood””Slayer: The Origins of Thrash in San Francisco, CA.””Why They Rule - #6 Slayer”originalet”Guitar World's 100 Greatest Heavy Metal Guitarists Of All Time”originalet”The fans have spoken: Slayer comes out on top in readers' polls”originalet”Tribute to Jeff Hanneman (1964-2013)””Lamb Of God Frontman: We Sound Like A Slayer Rip-Off””BEHEMOTH Frontman Pays Tribute To SLAYER's JEFF HANNEMAN””Slayer, Hatebreed Doing Double Duty On This Year's Ozzfest””System of a Down””Lacuna Coil’s Andrea Ferro Talks Influences, Skateboarding, Band Origins + More””Slayer - Reign in Blood””Into The Lungs of Hell””Slayer rules - en utställning om fans””Slayer and Their Fans Slashed Through a No-Holds-Barred Night at Gas Monkey””Home””Slayer””Gold & Platinum - The Big 4 Live from Sofia, Bulgaria””Exclusive! Interview With Slayer Guitarist Kerry King””2008-02-23: Wiltern, Los Angeles, CA, USA””Slayer's Kerry King To Perform With Megadeth Tonight! - Oct. 21, 2010”originalet”Dave Lombardo - Biography”Slayer Case DismissedArkiveradUltimate Classic Rock: Slayer guitarist Jeff Hanneman dead at 49.”Slayer: "We could never do any thing like Some Kind Of Monster..."””Cannibal Corpse'S Pat O'Brien Will Step In As Slayer'S Guest Guitarist | The Official Slayer Site”originalet”Slayer Wins 'Best Metal' Grammy Award””Slayer Guitarist Jeff Hanneman Dies””Kerrang! Awards 2006 Blog: Kerrang! Hall Of Fame””Kerrang! Awards 2013: Kerrang! Legend”originalet”Metallica, Slayer, Iron Maien Among Winners At Metal Hammer Awards””Metal Hammer Golden Gods Awards””Bullet For My Valentine Booed At Metal Hammer Golden Gods Awards””Metal Storm Awards 2006””Metal Storm Awards 2015””Slayer's Concert History””Slayer - Relationships””Slayer - Releases”Slayers officiella webbplatsSlayer på MusicBrainzOfficiell webbplatsSlayerSlayerr1373445760000 0001 1540 47353068615-5086262726cb13906545x(data)6033143kn20030215029