[Networkit] CoreDecomposition and self-loops

Henning Meyerhenke henning.meyerhenke at kit.edu
Sat Oct 3 10:47:24 CEST 2015


Core decomposition is supposed to measure the quantity _and_ quality of 
connections (to other nodes), right? Self-loops do not contribute to 
this in my opinion. Is there a reason to account for them? I do not have 
access to the literature right now, how do others handle self-loops in 
this context?

My recommendation would be to delete self-loops driven by a 
user-specified flag (yes/no, default = yes??). Or to simply ignore them 
during the course of the algorithm if possible. Arie, would you be 
willing to do this if we do not hear other opinions?


Am 02.10.15 um 17:53 schrieb Arie Slobbe:
> Hi Christian,
> I agree that letting the algorithm cope with self-loops would be more
> user-friendly. The exception was an immediate solution to an immediate
> problem. I would be glad to help with improving this!
> On Fri, Oct 2, 2015 at 11:03 AM, Christian Staudt
> <christian.staudt at kit.edu <mailto:christian.staudt at kit.edu>> wrote:
>     Currently, core decomposition throws an exception if the input graph
>     has self-loops.
>              if (G.numberOfSelfLoops()) throw std::runtime_error("Core
>     Decomposition implementation does not support graphs with
>     self-loops. Call Graph.removeSelfLoops() first.”);
>     What is the rationale for this behavior? Self-loops are quite
>     common, so could we make this more user-friendly by letting the
>     algorithm cope with self-loops?
>     Best,
>     Chris
>     _______________________________________________
>     NetworKit mailing list
>     NetworKit at ira.uni-karlsruhe.de <mailto:NetworKit at ira.uni-karlsruhe.de>
>     https://lists.ira.uni-karlsruhe.de/mailman/listinfo/networkit
> _______________________________________________
> NetworKit mailing list
> NetworKit at ira.uni-karlsruhe.de
> https://lists.ira.uni-karlsruhe.de/mailman/listinfo/networkit


Karlsruhe Institute of Technology (KIT)
Institute of Theoretical Informatics (ITI)

Prof. Dr. Henning Meyerhenke
Theoret. Informatics / Parallel Computing

Phone: +49-721-608-41876
Web: http://parco.iti.kit.edu/henningm/

KIT - University of the State of Baden-Wuerttemberg and
National Research Center of the Helmholtz Association

-------------- next part --------------
A non-text attachment was scrubbed...
Name: smime.p7s
Type: application/pkcs7-signature
Size: 5399 bytes
Desc: S/MIME Cryptographic Signature
URL: <https://lists.ira.uni-karlsruhe.de/mailman/private/networkit/attachments/20151003/53037452/attachment-0001.p7s>

More information about the NetworKit mailing list