From the 1 of 6 linked papers with an AI index.
6 papers
Extending Biconnected Straight-Line Planar Drawings
Giordano Andreola, Susanna Caroppo, Giordano Da Lozzo +5
The paper investigates the difficulty of extending a straight-line planar drawing of a biconnected subgraph to the whole graph, showing NP‑hardness in the variable‑embedding case a…
High-Modularity Graph Partitioning Through NLP Techniques and Maximal Clique Enumeration
Marco D'Elia, Irene Finocchi, Maurizio Patrignani
Natural Language Processing (NLP) provides highly effective tools for interpreting and handling human language, offering a broad spectrum of applications. In this paper, we address…
On Large Induced Outerplanar Subgraphs in -Outerplanar Graphs
Marco D'Elia, Fabrizio Frati
Borradaile, Le and Sherman-Bennett [Graphs and Combinatorics, 2017] proved that every -vertex -outerplane graph has a set of at least vertices that induces an outerpla…
Engineering Algorithms for -Isolated Maximal Clique Enumeration
Marco D'Elia, Irene Finocchi, Maurizio Patrignani
Maximal cliques play a fundamental role in numerous application domains, where their enumeration can prove extremely useful. Yet their sheer number, even in sparse real-world graph…
Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs
Marco D'Elia, Fabrizio Frati
In this paper, we study the following question. Let be a family of planar graphs and let be an integer. What is the largest value such that every $n…
Upward Pointset Embeddings of Planar st-Graphs
Carlos Alegria, Susanna Caroppo, Giordano Da Lozzo +5
We study upward pointset embeddings (UPSEs) of planar -graphs. Let be a planar -graph and let be a pointset with . An UPSE of …