AI Chat AI Image Generator AI Video Text to Speech

SMS in PACE 2020

06/12/2020
∙
by   Tuukka Korhonen, et al.
∙
0
∙

We describe SMS, our submission to the exact treedepth track of PACE 2020. SMS computes the treedepth of a graph by branching on the small minimal separators of the graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 06/30/2019

Minimal bricks

A brick is a 3-connected graph such that the graph obtained from it by d...
0 Serguei Norine, et al. ∙
research
∙ 08/22/2020

On the Size of Minimal Separators for Treedepth Decomposition

Treedepth decomposition has several practical applications and can be us...
0 Zijian Xu, et al. ∙
research
∙ 10/30/2019

Improved Bounds for Track Numbers of Planar Graphs

A track layout of a graph consists of a vertex coloring and of a total o...
0 Sergey Pupyrev, et al. ∙
research
∙ 08/20/2020

Compression with wildcards: All exact, or all minimal hitting sets

Our main objective is the COMPRESSED enumeration (based on wildcards) of...
0 Marcel Wild, et al. ∙
research
∙ 04/21/2021

The 1-1 algorithm for Travelling Salesman Problem

The Travelling Salesman Problem (TSP), finding a minimal weighted Hamilt...
0 Heping Jiang, et al. ∙
research
∙ 07/01/2019

Computing a Smaller Unit-Distance Graph with Chromatic Number 5 via Proof Trimming

We present a method to gradually compute a smaller and smaller unsatisfi...
0 Marijn J. H. Heule, et al. ∙
research
∙ 04/03/2019

A spatial small-world graph arising from activity-based reinforcement

In the classical preferential attachment model, links form instantly to ...
0 Markus Heydenreich, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal