Work

Deterministic Distributed DFS via Cycle Separators in Planar Graphs

Year: 2025

Type: conference-paper

Abstract: One of the most basic techniques in algorithm design consists of breaking a problem into subproblems and then proceeding recursively. In the case of graph algorithms, one way to implement this approach is through separator sets. Given a graph G = (V, E), a subset of nodes S ⊆ V is called a separator set of G if the size of each connected component of G - S is at most 2/3 · |V|. The most useful separator sets are those that satisfy certain restrictions of cardinality or structure.

Source: ACM Symposium on Principles of Distributed Computing (PODC)

DOI: 10.1145/3732772.3733558

Authors: Benjamin Jauregui, Pedro Montealegre, Ivan Rapaport

Institutions: University of Chile, Adolfo Ibáñez University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funder: Agencia Nacional de Investigación y Desarrollo

Awards: G4003710626, COMPACT DISTRIBUTED CERTIFICATION OF HEREDITARY GRAPH CLASSES, CENTER FOR MATHEMATICAL MODELING (CMM), COMPUTING POWER OF HYBRID MODELS IN SYNCHRONOUS NETWORKS