29 citations · 48 across the 20 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DS2021
Hitting minors on bounded treewidth graphs. III. Lower bounds
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
For a finite collection of graphs , the -M-DELETION problem consists in, given a graph and an integer , decide whether there exists wi…
cs.DS2021
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
For a finite collection of graphs , the -M-DELETION (resp. -TM-DELETION) problem consists in, given a graph and an integer , decide whether the…
cs.DS2021
A Neighborhood-preserving Graph Summarization
Abd Errahmane Kiouche, Julien Baste, Mohammed Haddad +1
We introduce in this paper a new summarization method for large graphs. Our summarization approach retains only a user-specified proportion of the neighbors of each node in the gra…