Cook and download a directory from the Software Heritage Vault
You have requested the cooking of the directory with identifier swh:1:dir:33e11fd48c03a23097cad4986019ab5e2fef40ac into a standard tar.gz archive
.
Are you sure you want to continue ?
Download a directory from the Software Heritage Vault
You have requested the download of the directory with identifier swh:1:dir:33e11fd48c03a23097cad4986019ab5e2fef40ac as a standard tar.gz archive
.
Are you sure you want to continue ?
Cook and download a revision from the Software Heritage Vault
You have requested the cooking of the history heading to revision with identifier swh:1:rev:b1e762cae4768d2b8b3ba3d946048e056ccb5e16 into a bare git archive
.
Are you sure you want to continue ?
Download a revision from the Software Heritage Vault
You have requested the download of the history heading to revision with identifier swh:1:rev:b1e762cae4768d2b8b3ba3d946048e056ccb5e16 as a bare git archive
.
Are you sure you want to continue ?
Invalid Email !
The provided email is not well-formed.
Download link has expired
The requested archive is no longer available for download from the Software Heritage Vault.
Do you want to cook it again ?
{ "@xmlns": "http://www.w3.org/2005/Atom", "@xmlns:codemeta": "https://doi.org/10.5063/SCHEMA/CODEMETA-2.0", "author": { "email": "hal@ccsd.cnrs.fr", "name": "HAL" }, "client": "hal", "codemeta:applicationCategory": [ "math.math-ct", "info.info-bi" ], "codemeta:author": [ { "codemeta:affiliation": "IML", "codemeta:name": "Alain Gu{\\'e}noche" }, { "codemeta:affiliation": "TAGC", "codemeta:name": "Charles E Chapple" }, { "codemeta:affiliation": "TAGC", "codemeta:name": "Beno{\\^i}t Robisson" } ], "codemeta:dateCreated": "2018-11-22T08:44:11+01:00", "codemeta:description": "This program builds an overlapping class system from an unweighted simple graph G=(V,E). Let |V|=n and |E|=m. It is essentially a hierarchical ascending algorithm joining two classes at each step. The optimized criterion is the modularity. It can be either the average gain or the total gain. The initial overlapping class system can be : - the set of all maximal cliques (it can take a long time to establish) - the set of edges (many initial classes (m) implying many steps (O(m)) - the set of ''centered cliques'' (at most n), giving a fast solution for large graphs. Two class systems can be calculated, the one maximazing the modularity, or the final one. In that case, the expected minimum number of clusters and the maximum caldinality of the final clusters are required. Fusion of classes are realized until one of these conditions is fullfiled. When no more class fusion can be realized the algorithm stops. Let p be the number of initial classes. The complexity is this algorithm is O(p^3).", "codemeta:license": { "codemeta:name": "GNU General Public License version 3" }, "codemeta:name": "OCG - Overlapping Class Generator", "codemeta:url": "https://hal.archives-ouvertes.fr/hal-01882844", "codemeta:version": "1", "committer": "Lionel Spinelli", "external_identifier": "hal-01882844", "id": "hal-01882844" }
To reference or cite the objects present in the Software Heritage archive, permalinks based on SoftWare Hash IDentifiers (SWHIDs) must be used.
Select below a type of object currently browsed in order to display its associated SWHID and permalink.
File | Mode | Size |
---|---|---|
AUTHORS | -rw-r--r-- | 200 bytes |
LICENSE | -rw-r--r-- | 31.3 KB |
OCG.c | -rw-r--r-- | 41.9 KB |
README | -rw-r--r-- | 2.2 KB |
Computing file changes ...