Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques

Due to the sheer size of real-world networks, delay and space become quite relevant measures for the cost of enumeration in network analytics. This paper presents efficient algorithms for listing maximum cliques in networks, providing the first sublinear-space bounds with guaranteed delay per enumerated clique, thus comparing favorably with the known literature

Le opportunità per una rivoluzione urbana. Il caso delle capitali europee della cultura.

L'articolo si propone di fornire una breve panoramica sulle questioni di pianificazione urbanistica delle Capitali europee della cultura, con una particolare enfasi sulla organizzazione della città di Matera

On Maximal Cliques with Connectivity Constraints in Directed Graphs

Finding communities in the form of cohesive subgraphs is a fundamental problem in network analysis. In domains that model networks as undirected graphs, communities are generally associated with dense subgraphs, and many community models have been proposed. Maximal cliques are arguably the most widely studied among such models, with early works dating back to the \u2760s, and a continuous stream of research up to the present. In domains that model networks as directed graphs, several approaches for community detection have been proposed, but there seems to be no clear model of cohesive subgraph, i.e., of what a community should look like. We extend the fundamental model of clique to directed graphs, adding the natural constraint of strong connectivity within the clique. We characterize the problem by giving a tight bound for the number of such cliques in a graph, and highlighting useful structural properties. We then exploit these properties to produce the first algorithm with polynomial delay for enumerating maximal strongly connected cliques

«Go on with the fight until the total redemption of the Dalmatia». A short story of the Zara young university students (1899-1939)

The article examines the evolution of the Dalmatian Fascist University Group (Gufd), which originated from the Society of Italian Students of Dalmatia (Ssid), founded in Zara (Zadar) in 1899. Initially focused on cultural promotion and defending the interests of Italian-Dalmatian students, after 1919 the Ssid transformed into a vehicle for fascism and political irredentism, aiming for Dalmatia’s annexation to Italy. With the rise of the Gufd in the 1920s, there was a growing activism on the part of registered students aimed at raising awareness of the Dalmatian problem among their peers in Italy. However, as initially seen as an ally for Italian cultural preservation in Dalmatia, fascism eventually constrained youthful aspirations, creating conflict between their irredentist ideals and its totalitarian goals

McDag: Indexing Maximal Common Subsequences in Practice

Analyzing and comparing sequences of symbols is among the most fundamental problems in computer science, possibly even more so in bioinformatics. Maximal Common Subsequences (MCSs), i.e., inclusion-maximal sequences of non-contiguous symbols common to two or more strings, have only recently received attention in this area, despite being a basic notion and a natural generalization of more common tools like Longest Common Substrings/Subsequences. In this paper we simplify and engineer recent advancements on MCSs into a practical tool called McDag, the first publicly available tool that can index MCSs of real genomic data. We demonstrate that our tool can index sequences exceeding 10,000 base pairs within minutes, utilizing only 4-7% more than the minimum required nodes, while also extracting relevant insights

Another Time-Complexity Analysis for Maximal Clique Enumeration Algorithm CLIQUES

We revisit the maximal clique enumeration algorithm CLIQUES that appeared in Theoretical Computer Science 2006. It is proved to work in O(3n/3)-time in the worst-case for an n vertex graph. In this note, we extend the time-complexity analysis with respect to the number of maximal cliques, an issue that was left as an open problem since TCS 2006