One reason of this hardness is that being k-anonymous is not a hereditary property: Simply deleting one vertex in a three-regular graph, that is, an n-anonymous ...
A graph is said to be k-anonymous for an integer k, if for every vertex in the graph there are at least k−1k−1 other vertices with the same degree.
Dec 31, 2015 · In particular, we show that both variants remain NP-hard on very restricted graph classes like trees even if k=2 k = 2 . We further prove that ...
Finding large degree-anonymous subgraphs is hard - ResearchGate
www.researchgate.net › ... › Hardness
A graph is said to be k-anonymous for an integer k, if for every vertex in the graph there are at least k−1 other vertices with the same degree.
A graph is said to be k-anonymous for an integer k, if for every vertex in the graph there are at least k - 1 other vertices with the same degree.
Finding large degree-anonymous subgraphs is hard · C. Bazgan, Robert Bredereck, +2 authors. G. Woeginger · Published in Theoretical Computer Science 4 April 2016 ...
A graph is said to be k-anonymous for an integer k, if for every vertex in the graph there are at least k-1 other vertices with the same degree.
Bibliographic details on Finding large degree-anonymous subgraphs is hard.
In particular, we show that both variants remain NP-hard on very restricted graph classes like trees even if k=2 k = 2 . We further prove that both variants are ...
Fingerprint. Dive into the research topics of 'Finding large degree-anonymous subgraphs is hard'. Together they form a unique fingerprint.