Day, hour and place

Tuesday at 2pm, room 3052 or online

The calendar of events (iCal format).
In order to add the event calendar to your favorite agenda, subscribe to the calendar by using this link.


Next talk

Distributed algorithms and graphs
Tuesday April 13, 2021, 3PM, ZOOM
Adrian Pastine (Universidad Nacional de San Luis) Null Decomposition of Graphs

Given a vector $\vec{x}$ in the null space of the adjacency matrix of a graph $G$, the support of $\vec{x}$ are the vertices which correspond to non-zero coordinates of $\vec{x}$. The support of $G$, $\Supp{G}$, is the union of the supports of all vectors in the null space of its adjacency matrix. The null decomposition of $G$, first introduced by Jaume and Molina in 2018, studies two subgraphs of $G$, $C_S(G)$, induced by the vertices in $\Supp{G}$ and their neighbours, and $C_N(G)$, induced by the remaining vertices.

In this talk, we study the null decomposition of bipartite graphs without cycles of length $0$ modulo $4$. We show that $C_S(G)$ contains a unique maximum independent set and that $C_N(G)$ contains a unique maximum matching. We use the decomposition to show that $\Supp{G}$ is the intersection of all maximum independent sets of $G$, and the union of the unmatched vertices over all maximum matchings. As an application, we present an algorithm that finds a sparse basis for the null space of adjacency matrix of forests in optimal time.

This talk is based on joint work with Daniel Jaume and Gonzalo Molina, from Universidad Nacional de San Luis, and Martin Safe, from Universidad Nacional del Sur.

Previous talks

Year 2021

Distributed algorithms and graphs
Tuesday March 16, 2021, 2PM, ZOOM
Filippo Brunelli (IRIF) On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks

A weighted point-availability time-dependent network is a list of temporal edges, where each temporal edge has an appearing time value, a travel time value, and a cost value. We consider the single source Pareto problem in weighted point-availability time-dependent networks, which consists of computing, for any destination $d$, all Pareto optimal pairs $(t,c)$, where $t$ and $c$ are the arrival time and the cost of a path from $s$ to $d$, respectively (a pair $(t,c)$ is Pareto optimal if there is no path with arrival time smaller than $t$ and cost no worse than $c$ or arrival time no greater than $t$ and better cost). We design and analyse a general algorithm for solving this problem, whose time complexity is $O(M\log P)$, where $M$ is the number of temporal edges and $P$ is the maximum number of Pareto optimal pairs for each node of the network. This complexity significantly improves the time complexity of the previously known solution. Our algorithm can be used to solve several different minimum cost path problems in weighted point-availability time-dependent networks with a vast variety of cost definitions, and it can be easily modified in order to deal with the single destination Pareto problem.

Meeting ID: 894 0889 8417 Passcode: 005585

Distributed algorithms and graphs
Tuesday March 2, 2021, 2PM, Online Via ZOOM
Stephane Devismes (VERIMAG U. Grenoble Alpes) Self-stabilizing Systems in Spite of High Dynamics

A self-stabilizing distributed system, regardless its initial configuration, converges within finite time to a configuration from which its behavior is correct. By essence, self-stabilization is a non-masking fault tolerant approach since the arbitrary initial configuration can be seen as the result of arbitrary transient faults.

In this talk, we will consider self-stabilization in highly dynamic networks, i.e., networks suffering from unexpected and frequent topological changes. Precisely, assuming that nodes are uniquely identified, we study the self-stabilizing leader election problem in three important classes of dynamic networks to obtain solutions tolerating both transient faults (such as memory corruption) and frequent topological changes.

We first study conditions under which our problem can be solved and then propose several algorithms. Our results reveal that the assumption on the knowledge of the number N of processes is central. Indeed, we show that, as soon as there is no strong guarantees on the temporal connectivity in the network, the knowledge of the exact value of N is required. Finally, the convergence time of self-stabilizing leader election cannot be bounded in some important cases. In those cases, we show that our solutions are speculative since their convergence time can be still bounded in a subset of more probable executions.

Distributed algorithms and graphs
Thursday February 25, 2021, 2PM, Online, via Zoom
Matej Stehlik (G-SCOP) Critical subgraphs of Kneser graphs

The Kneser graph KG(n,k) is the graph whose vertex set consists of all k-subsets of an n-set, with edges joining pairs of disjoint subsets. Kneser graphs arise naturally in various contexts, and play a central role in fractional colouring. In 1978, Lovasz used tools from algebraic topology to prove that KG(n,k) is (n-2k+2)-chromatic, proving a long-standing conjecture of Kneser and laying the foundations of topological combinatorics. Shortly thereafter, Schrijver defined an induced subgraph SG(n,k) of KG(n,k), known as the Schrijver graph, and showed that SG(n,k) is also (n-2k+2)-chromatic. Moreover, he showed that SG(n,k) is vertex-critical, in the sense that the chromatic number decreases if any vertex is deleted. However, Schrijver graphs are in general not edge-critical: certain edges can be deleted without any effect on the chromatic number. In this talk, I will define an (n-2k+2)-chromatic edge-critical subgraph of SG(n,k), thereby sharpening the classical results of Lovasz and Schrijver.

Joint work with Tomas Kaiser.

Distributed algorithms and graphs
Tuesday February 23, 2021, 2PM, Online, via Zoom
Arnau Padrol (Institut de Mathématiques de Jussieu) Sweeps, polytopes, oriented matroids, and allowable graphs of permutations

A sweep of a point configuration is an ordered partition induced by a linear functional. These orders are at the core of several applications in discrete and computational geometry, and also appear naturally in linear programming. The set of orderings obtained this way is highly structured: isomorphic to the face lattice of a convex polytope. In the plane, they were formalized and abstracted by Goodman and Pollack under the theory of allowable sequences of permutations, but a high dimensional generalization was missing. I will present an overview of the theory, discuss polytopal constructions, and introduce combinatorial generalizations in terms of oriented matroids and allowable graphs of permutations.

This is based on joint work with Eva Philippe.

Distributed algorithms and graphs
Tuesday February 2, 2021, 2PM, Salle 3052 and ZOOM
Zhouningxin Wang (IRIF) Density of C_{-4}-critical signed graphs

By extending the notion of indicator to signed graphs, we show the problem of 4-coloring is captured by the problem of C_{-4}-coloring (mapping signed graphs to a negative 4-cycle). Moreover, we extend the notion of H-critical to (H, \pi)-critical. In this talk, we prove that any C_{-4}-critical signed graph on n vertices, except for one particular signed bipartite graph on 7 vertices and 9 edges, must have at least 4n/3 edges. As an application to planarity, we conclude that every signed bipartite planar graph of negative girth at least 8 admits a homomorphism to C_{-4} and show that this bound is the best possible, which is relevant to a bipartite analog of Jaeger-Zhang conjecture.

Zoom link:

Meeting ID: 894 0889 8417 Passcode: 005585

Distributed algorithms and graphs
Tuesday January 12, 2021, 3PM, Online
Benjamin R. Moore (University of Waterloo) The Pseudoforest Nine Dragon Tree conjecture is true

I will give an overview of the following result. Let k and d be integers. Let G be a graph with maximum average degree at most 2k + 2d/(k+d+1). Then G decomposes into k+1 pseudoforests such that one of the pseudoforests has each connected component containing at most d edges. Here a pseudoforest is a graph where each component contains at most one cycle, and a decomposition is a partition of the edge set into edge disjoint subgraphs. By a result of Fan et al., the bound is best possible for all k and d, even when you ask for one pseudoforest with maximum degree at most d. This is joint work with Logan Grout.

Year 2020

Distributed algorithms and graphs
Tuesday November 24, 2020, 2PM, Online
Laurent Feuilloley (IRIF) Graph classes and forbidden patterns on three and four vertices

In this talk, I will present some results on the characterization and the recognition of graph classes.

A popular way to characterize a graph class is to list a minimal set of forbidden induced subgraphs. Unfortunately, this strategy hardly ever leads to a very efficient recognition algorithm. On the other hand, many graph classes can be efficiently recognized by techniques that use some ordering of the nodes, such as the one given by a traversal.

We study specifically graphs that have an ordering avoiding some ordered structures that we call *patterns*. Several well-known classes such as chordal, bipartite, interval, and comparability graphs have a characterization in terms of forbidden patterns. It is also known that any class defined by a set of forbidden patterns on three nodes can be recognized in polynomial time. In a recent paper, we've characterized systematically all the classes defined by sets of forbidden patterns (on three nodes). Surprisingly there is a relatively small number of them, and they are all well-known. Also, almost all of them can actually be recognized in linear time. I will talk about these results and about the rich structure of the classes defined by patterns. I will also talk about on-going work in building bridges between intersection graphs and patterns on four vertices.

Distributed algorithms and graphs
Tuesday October 20, 2020, 2PM, Salle 3052
Pierre Fraigniaud (IRIF) Distributed Certification of Graph Classes

Distributed certification is a sub-topic of distributed computing aiming at providing tools for enabling a set of autonomous computing entities (a.k.a. processes) to coordinate for deciding whether the distributed system at hand satisfies a given correctness certificates. Among many scenarios, one important aspect of this line of study is certifying that the actual network of processes satisfies some given graph properties (e.g., being 3-colorable, being acyclic, being planar, etc.). The main constraint for deciding whether the property holds is that computation must be local, that is, every process may interact only once with its neighbors in the network. Not all graph properties are decidable under this constraint. For those “locally undecidable“ classes, it is however possible to distribute a proof that the network satisfies the property, by assigning small certificates to the nodes, which can then be checked locally. Nevertheless, some properties (e.g., non 3-colorability) may require huge certificates. To decrease the size of the certificates, interactive proofs have been considered, where every process interacts first with an external entity (e.g., the “cloud“) before interacting locally with its neighbors for forging its opinion regarding whether the graph satisfies the property or not. The talk will present these different mechanisms. It will illustrate them using specific graph properties like planarity and bounded genus, and will discuss the ability to certify graph excluding a specific given minor.

Distributed algorithms and graphs
Tuesday October 6, 2020, 2PM, Salle 3052
Marthe Bonamy (CNRS, LaBRI) On Vizing's edge colouring question

In his 1965 seminal paper on edge colouring, Vizing proved that a (Delta+1)-edge colouring can be reached from any given proper edge colouring through a series of Kempe changes, where Delta is the maximum degree of the graph. He concludes the paper with the following question: can an optimal edge colouring be reached from any given proper edge colouring through a series of Kempe changes? In other words, if the graph is Delta-edge-colourable, can we always reach a Delta-edge-colouring? If true, this would imply a more recent conjecture of Mohar (2006) that in any graph, all (Delta+2)-edge-colourings are equivalent up to a series of Kempe changes. We discuss recent progress around these questions.

Distributed algorithms and graphs
Tuesday September 22, 2020, 3PM, Salle 3052
Rongxing Xu Multiple list colouring of $3$-choice critical graphs

A graph $G$ is called $3$-choice critical if $G$ is not $2$-choosable but any proper subgraph is $2$-choosable. A characterization of $3$-choice critical graphs was given by Voigt in 1998. Voigt conjectured that if $G$ is a bipartite $3$-choice critical graph, then $G$ is $(4m, 2m)$-choosable for every integer $m$. It is true if $G=\Theta_{2,2,2,2}$, which was proved by Voigt and Tuza in 1996. However, this conjecture was disproved by Meng, Puleo, and Zhu in 2017. They showed that if $G=\Theta_{r,s,t}$ where $r,s,t$ have the same parity and $\min\{r,s,t\} \ge 3$, or $G=\Theta_{2,2,2,2p}$ with $p \ge 2$, then $G$ is bipartite $3$-choice critical, but not $(4,2)$-choosable. On the other hand, all the other bipartite 3-choice critical graphs are $(4,2)$-choosable. This paper strengthens the result of Meng, Puleo, and Zhu and shows that all the other bipartite $3$-choice critical graphs are $(4m,2m)$-choosable for every integer $m$.

Distributed algorithms and graphs
Tuesday June 2, 2020, 3:30PM, Online
Julien Baste (Universität Ulm) Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory

When modeling an application of practical relevance as an instance of a combinatorial problem X, we are often interested not merely in finding one optimal solution for that instance, but in finding a sufficiently diverse collection of good solutions. In this work we initiate a systematic study of diversity from the point of view of fixed-parameter tractability theory. First, we consider an intuitive notion of diversity of a collection of solutions which suits a large variety of combinatorial problems of practical interest. We then present an algorithmic framework which –automatically– converts a tree decomposition-based dynamic programming algorithm for a given combinatorial problem X into a dynamic programming algorithm for the diverse version of X. Surprisingly, our algorithm has a polynomial dependence on the diversity parameter.

Distributed algorithms and graphs
Friday May 29, 2020, 2PM, Online
Guillaume Ducoffe Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension

Under the Strong Exponential-Time Hypothesis, the diameter of general unweighted graphs cannot be computed in truly subquadratic time. Nevertheless there are several graph classes for which this can be done such as bounded-treewidth graphs, interval graphs and planar graphs, to name a few. We propose to study unweighted graphs of constant distance VC-dimension as a broad generalization of many such classes – where the distance VC-dimension of a graph G is defined as the VC-dimension of its ball hypergraph: whose hyperedges are the balls of all possible radii and centers in G. In particular for any fixed H, the class of H-minor free graphs has distance VC-dimension at most |V(H)|− 1.

• Our first main result is a Monte Carlo algorithm that on graphs of distance VC-dimension at most d, for any fixed k, either computes the diameter or concludes that it is larger than k in time O(k · mn^{1−εd}), where εd ∈ (0; 1) only depends on d. We thus obtain a truly subquadratic-time parameterized algorithm for computing the diameter on such graphs. • Then as a byproduct of our approach, we get a truly subquadratic-time randomized algorithm for constant diameter computation on all the nowhere dense graph classes. The latter classes include all proper minor-closed graph classes, bounded-degree graphs and graphs of bounded expansion. • Finally, we show how to remove the dependency on k for any graph class that excludes a fixed graph H as a minor. More generally, our techniques apply to any graph with constant distance VC-dimension and polynomial expansion (or equivalently having strongly sublinear balanced separators). As a result for all such graphs one obtains a truly subquadratictime randomized algorithm for computing their diameter.

We note that all our results also hold for radius computation. Our approach is based on the work of Chazelle and Welzl who proved the existence of spanning paths with strongly sublinear stabbing number for every hypergraph of constant VC-dimension. We show how to compute such paths efficiently by combining known algorithms for the stabbing number problem with a clever use of ε-nets, region decomposition and other partition techniques.

If time allows, I will also mention recent improvements of the above results, to eccentricity and distance oracle computations.

This is joint work with Michel Habib and Laurent Viennot.

Distributed algorithms and graphs
Tuesday April 14, 2020, 3:30PM, Online
Pierluigi Crescenzi (IRIF) Temporal Closeness in Temporal Networks

The closeness centrality measure associates to each node of a graph its average distance from all the other nodes. In this talk, we will consider a temporal version of this measure, which have been recently introduced and analysed in the case of temporal graphs (that is, graphs in which edges can appear and disappear during time). In particular, we will show how this measure can be efficiently approximated by using a “backward” temporal breadth-first search algorithm and a classical sampling technique. We will then introduce a “temporally global” closeness centrality measure of a node in a temporal graph, which is quite similar to the notion of AUC (Area Under Curve), and we will show how this global measure can also be efficiently approximated. We conclude by presenting several experimental results in the case of medium/large real-world temporal networks. This is a joint work with Clémence Magnien and Andrea Marino.

Distributed algorithms and graphs
Tuesday April 7, 2020, 3:30PM, Online
Pierre Berge Fixed-parameter algorithms for finding small separators in graphs

In this talk, I introduce some results obtained during my Ph.D. All of them deal with cut and connectivity problems in graphs. I present the parameterized complexity of the Partial One-Target Cut (POTC) problem, where the objective is to identify the smallest edge cutset separating a certain proportion r of sources into an input set S={s_1,…,s_k} with a single target t. I provide the proof that POTC is fixed-parameter tractable (FPT) parameterized by the cutset size p. This means that an algorithm finds an exact solution in time f(p)P(n), where f is an arbitrary function, P a polynomial function, and n the instance size. The algorithm is based on the random sampling of important separators. This result highlights a surprising complexity gap between the edge and the vertex versions of the problem. Indeed, when the cutset is made up of vertices, POTC is unlikely to be FPT.

Distributed algorithms and graphs
Tuesday January 28, 2020, 2PM, Salle 3052
Ana Silva (Departamento de Matemática - Universidade Federal do Ceará) Time for coloring

A temporal graph with lifetime $T$ is a pair $(G,\lambda)$ where $G$ is a simple graph with $n$ nodes and $\lambda:E(G)\rightarrow [T]$ is a function of discrete-timed labels telling the snapshots where an edge is active. As recently defined, a temporal coloring of $(G,\lambda)$ is a coloring of each snapshot that properly colors each edge at least once throughout its lifetime; and the \emph{temporal chromatic number of $(G,\lambda)$} is the minimum number $t\chi(G,\lambda)$ of colors that can be used to get a temporal coloring.

In this talk, I will present the results, obtained in collaboration with Andrea Marino, in which we focus on temporal graphs whose edges remain active for at least $t$ timestamps (these are called $t$-persistent temporal graphs). Among other things, we: 1) give some upper bounds for the minimum number of colors needed in terms of $t$ and of the chromatic number of the underlying static graph $G$; 2) prove that $k$ colors are always sufficient when $t$ is at least $\log_k n$, and that if $t$ is smaller, then it is NP-complete to decide whether $k$ colors are enough; 3) prove that the problem is NP-complete even when $G$ has bounded treewidth, and each snapshot is planar and has constant size; and 4) give an FPT algorithm with parameters the treewidth of $G$ and $T$.

Our results also imply many interesting facts: for instance, we know that if $G$ is planar and 2-persistent, then 2 colors are always sufficient

Year 2019

Distributed algorithms and graphs
Tuesday December 3, 2019, 2PM, Salle 1007
Marc Heinrich Counting independent sets in strongly orderable graphs

We are interested in counting problems which consists in computing the number of solutions to a given instance of the problem. This kind of question has strong connexions, in particular in the case of independent sets, with problems from statistical physics and what is called the hard core distribution. As many counting problems, counting exactly the number of independent sets of a graphs is difficult (i.e., #P-complete) even on bipartite graphs, and even difficult to approximate for general graphs. On the other hands, it was shown to be polynomial time solvable for more restricted classes of graphs such as chordal graphs, cographs or monotone bipartite graphs. We show that the number of independent sets can also be computed in polynomial time for strongly orderable graphs which is a super-class of chordal bipartite and strongly chordal graphs. This is joint work with Haiko Muller.

Distributed algorithms and graphs
Tuesday November 26, 2019, 2PM, Salle 1007
Denis Cornaz (Université Paris Dauphine) Flows in signed graphs

Packing negative cycles in signed graphs has application to multiflow problem. It allows to predict when the cut condition is sufficient for the existence of a multiflow satisfying the demand. Here the signed edges play the role of the demand, and the unsigned edges play the role of the links. We investigate a min-max relation in this context related to the notion of box totally-dual-integral linear systems.

Distributed algorithms and graphs
Tuesday November 12, 2019, 3:30PM, Salle 3052
Suchismita Mishra (IITM) Strong chromatic index of unitary Cayley graphs

A strong edge coloring of a graph is an assignment of colors to edges such that every color class induces a matching. The smallest number of colors for which a strong edge coloring of a graph G exists is known as the strong chromatic index and it is denoted by $\chi′_s(G)$. It is already known that the problem of finding the strong chromatic index for arbitrary graphs is NP-complete. In this talk, we will discuss strong edge coloring of unitary Cayley graphs.

Distributed algorithms and graphs
Wednesday November 6, 2019, 11AM, Salle 3052
Laurent Viennot Distance labeling, Ruzsa-Szemeredi graphs and SumIndex communication complexity problem

A distance labeling consists in coding the distances in a graph by assigning a label L_u to each vertex u, such that the distance between two nodes u and v can be computed from L_u et L_v. We will see that the minimum size of labels in a constant degree graph is related to other parameters coming from combinatorics and communication complexity. The first one is the Ruzsa-Szemeredi number that measures the maximum number of edges in an n-node graph that can be decomposed into n induced matchings (an edge of one matching cannot be incident to two edges of another matching). The second one is the minimum size of messages in the SumIndex problem where Alice knows an n-bit vector X and an index a, Bob knows X and an index b, and where they both send a message to a referee that should compute the bit of X in position a+b mod n from the two messages (the referee does not know X).

Joint work with Adrian Kosowski and Przemyslaw Uznanski.

Distributed algorithms and graphs
Tuesday October 22, 2019, 2PM, Salle 3052
Michael Lampis (Universite Paris Dauphine) Finer Tight Bounds for Coloring on Clique-Width

We revisit the complexity of Coloring with respect to two parameters: the number of given colors k; and the “width” of the input graph w. Here, by width we mean a measure of complexity of the graph. When the notion of width in question is treewidth, the problem is very well-understood: there exists a simple k^w algorithm, and no algorithm can do significantly better under the Strong Exponential Time Hypothesis (SETH), even if we replace treewidth by much more restrictive notions, such distance to linear forest. In this talk we will consider the notion of clique-width, which is the most well-studied generalization of treewidth for dense graphs. We will sketch an algorithm and a matching lower bound (under the SETH) which completely determine the complexity of coloring as a function of clique-width, for any fixed k>=3.

Distributed algorithms and graphs
Tuesday October 8, 2019, 2PM, Salle 3052
Fabien De Montgolfier (IRIF) Algorithms for generalized modular decomposition

Modular decomposition is a graph decomposition that can be computed in linear time and allows to solve many problems efficiently when the width of the decomposition tree is bounded. In this talk we survey how to generalize it to some other objects: bipartite graphs, tournaments, and hypergraphs (for the latter three variations have been proposed). Algorithmic approaches and tools to compute them are presented: top-down method, bottom-up method, and orthogonals.

Distributed algorithms and graphs
Monday June 24, 2019, 11AM, Salle 3052
Carola Doerr (CNRS, LIP6 Sorbonne University) Evolutionary Algorithms – From Theory to Practice and Back

Most real-world optimization problems do not have an explicit problem formulation, but only allow to compute the quality of selected solution candidates. Solving such black-box optimization problems requires iterative procedures which use the feedback gained from previous evaluations to determine the strategy by which the next solution candidates are generated. Many black-box optimization algorithms, such as Simulated Annealing, Evolutionary Algorithms, Swarm Intelligence Algorithms, are randomized – making it very difficult to analyze their performances mathematically.

In the last 15 years, the theory of randomized black-box optimization has advanced considerably, and has contributed to efficient optimization by providing insights into the working principles of black-box optimization which are hard or impossible to obtain by empirical means. On the other hand, empirically-guided benchmarking has opened up new research directions for theoretical investigations.

In this presentation we will discuss the state of the art in the theory of randomized black-box optimization algorithms. As part of this critical survey we will also mention a number of open questions and connections to other fields of Computer Science.

Distributed algorithms and graphs
Tuesday May 28, 2019, 3PM, Salle 1007
Jean-Florent Raymond (TU Berlin) Enumerating minimal dominating sets in $K_t$-free graphs

In algorithmic enumeration, one is typically asked to output the set of all objects of a certain type related to an input (e.g. all the cycles of a graph, all its maximal cliques, etc.), rather than finding just one. The problem of enumerating all the minimal dominating sets of a graph received an important attention, partly because of its strong links with a fundamental hypergraph problem. A long standing open question is whether the above problem can be solved in (output-) polynomial time. In this talk, I will introduce the problem and present an output-polynomial algorithm for Kt-free graphs. This is joint work with Marthe Bonamy, Oscar Defrain, and Michał Pilipczuk.

Link to the article:

Distributed algorithms and graphs
Tuesday May 21, 2019, 2PM, Salle 3052
Ben Seamone (Université de Montréal and Dawson College) Eternal domination in graphs

Given a graph, how can one distribute resources to vertices in order to be able to respond to any infinite sequences of demands? This is the fundamental question which the study of eternal domination in graphs attempts to answer. I will give a brief survey of what is known about eternal domination, followed by recent progress on some eternal domination problems. Notably, we refute a conjecture of Klostermeyer and Mynhardt on eternal domination in prisms over graphs, and introduce a fractional version of eternal domination which to our knowledge has not yet been studied. Results were jointly obtained with D. Khatri, A. Krim-Yee, N. Kumar, G. MacGillivray, V. Virgile, and A. Xu.

Distributed algorithms and graphs
Thursday May 9, 2019, 3PM, Salle 1007
Amélie Gheerbrant (IRIF) Graph query languages

Graph databases use graph structure to represent and query data. The talk will survey some graph query languages used in this context, with a focus on regular path queries (RPQs) and conjunctive regular path queries (CRPQs). We will present the different semantics that graph database systems use for them (every path, simple path, trail), and recall computational complexities of query evaluation and query containment. We will finally discuss some issues related to querying not only the topology but also the data of the graph and present a few open problems that could be of interest both to the graph and algorithms group and to the automata group.

Distributed algorithms and graphs
Tuesday April 9, 2019, 2PM, Salle 3052
Binh-Minh Bui-Xuan (LIP6) Temporal matching

When mining data collected from human activities, graph edges come ordered by the time instants where they are recorded, e.g. with web logs, phone calls, email exchanges, … We call this kind of data a link stream. We introduce the notion of a temporal matching (an independent temporal edge set) in a link stream. In a link stream where the time dimension is reduced to one unique time instant, our new definition is equivalent to that of a matching in classical graph theory.

In contrast to classical graph theory, we show that the problem of computing a temporal matching of maximum size in a link stream is in general NP-hard. We then depict a kernelization algorithm parameterized by the solution size for the problem, producing quadratic kernels. As a byproduct we also give a 2-approximation algorithm. Both algorithms are implemented and confronted to link streams collected from real world graph data:

We observe from the experiments that the kernelization algorithm can perform very well in practice, reducing the instance size downto 10-20% on realistic mining parameters. In contrast, the 2-approximation gives rather mixed results. We conjecture that the approximation factor can be improved.

Distributed algorithms and graphs
Friday March 22, 2019, 2PM, Salle 1007
Julien Baste (Universität Ulm, Ulm, Germany) Hitting minors on bounded treewidth graphs

For a fixed collection of graphs F, the F-DELETION problem consists in, given a graph G and an integer k, decide whether there exists S, subset of V(G), with |S| ⇐ k such that G-S does not contain any of the graphs in F as a minor. This NP-hard problem is a generalization of some well known graph problems as VERTEX COVER (F={K_2}), FEEDBACK VERTEX SET (F={K_3}), or VERTEX PLANARIZATION (F={K_5,K_{3,3}}). We are interested in its parameterized complexity when the parameter is the treewidth of G, denoted by tw. Namely, the objective is to determine, for a fixed F, the (asymptotically) smallest function f_F: N → N such that F-DELETION can be solved in time f_F(tw)*n^{O(1)} on n-vertex graphs. In this talk we will provide the basic definitions of parameterized complexity, motivate the problem, and then, review some of the lower and upper bounds on the function f_F for several instantiations of F.

The presented results are joint work with Ignasi Sau and Dimitrios Thilikos and can be found in <>.

Distributed algorithms and graphs
Tuesday March 12, 2019, 2PM, Salle 3052
Rémy Belmonte Token Sliding on Split Graphs

We consider the complexity of the \textsc{Independent Set Reconfiguration} problem under the Token Sliding rule. In this problem we are given two independent sets of a graph and are asked if we can transform one to the other by repeatedly exchanging a vertex that is currently in the set with one of its neighbors, while maintaining the set independent. Our main result is to show that this problem is PSPACE-complete on split graphs (and hence also on chordal graphs), thus resolving an open problem in this area. We then go on to consider the $c$-\textsc{Colorable Reconfiguration} problem under the same rule, where the constraint is now to maintain the set $c$-colorable at all times.

Joint work with Eun-Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi and Florian Sikora.

Distributed algorithms and graphs
Wednesday March 6, 2019, 11AM, Salle 3052
Marc Lelarge (Inria & ENS Paris) Spectral embedding for graph classification

Learning on graphs requires a graph feature representation able to discriminate among different graphs while being amenable to fast computation. The graph isomorphism problem tells us that no fast representation of graphs is known if we require the representation to be both invariant to nodes permutation and able to discriminate two non-isomorphic graphs. Most graph representations explored so far require to be invariant. We explore new graph representations by relaxing this constraint. We present a generic embedding of graphs relying on spectral graph theory called Spectral Graph Embedding (SGE). We show that for a large family of graphs, our embedding is still invariant. To evaluate the quality and utility of our SGE, we apply them to the graph classification problem. Through extensive experiments, we show that a simple Random Forest based classification algorithm driven with our SGE reaches the state-of-the-art methods.

Although our SGE is handcrafted, we also show how our generic embedding technique can be learned and built in a data-driven manner opening the way to new learning algorithms and deep learning architectures with some invariant constraints built-in.

Distributed algorithms and graphs
Tuesday February 19, 2019, 2PM, Salle 1007
Marthe Bonamy (CNRS - LABRI) Around Brooks' theorem

In this talk, we will discuss various results around Brooks' theorem: a graph has chromatic number at most its maximum degree, unless it is a clique or an odd cycle. We will consider stronger variants and local versions, as well as the structure of the solution space of all corresponding colorings.

Distributed algorithms and graphs
Tuesday February 19, 2019, 11AM, Salle 3052
Danupon Nanongkai (KTH) Distributed Shortest Paths, Exactly

This talk concerns the problem of quickly computing distances and shortest paths on distributed networks (the CONGEST model). There have been many developments for this problem in the last few year, resulting in tight approximation schemes. This left open whether exact algorithms can perform equally well. In this talk, we will discuss some recent progress in answering this question. Most recent works that this talk is based on are with Sebastian Krinninger (FOCS 2018) and Aaron Bernstein (ArXiv 2018).

Distributed algorithms and graphs
Tuesday January 22, 2019, 2PM, Salle 3052
Guillaume Ducoffe (ICI Roumanie) Computing Giant Diameters with Breadth-First Search and Range Queries

A well-known problem for which it is difficult to improve the textbook algorithm is computing the graph diameter. We present two versions of a simple algorithm (one being Monte Carlo and the other deterministic) that for every fixed $h$ and unweighted undirected graph $G$ with $n$ vertices and $m$ edges, either correctly concludes that $diam(G) < hn$ or outputs $diam(G)$, in time ${\cal O}(m+n^{1+o(1)})$. The algorithm combines a simple randomized strategy for this problem (Damaschke, {\it IWOCA'16}) with a popular framework for computing graph distances that is based on range trees (Cabello and Knauer, {\it Computational Geometry'09}). We also prove that under the Strong Exponential Time Hypothesis (SETH), we cannot compute the diameter of a given $n$-vertex graph in truly subquadratic time, even if the diameter is an $\Theta(n/\log{n})$.

Year 2018

Distributed algorithms and graphs
Tuesday December 18, 2018, 3:30PM, Salle 3052
Bergougnoux Benjamin (IRIF) Rank Based Approach on Graphs with Structured Neighborhood

In this talk, I will present a framework combining the rank-based approach with the notion of $d$-neighbor equivalence. The rank-based approach is a technique introduced by Bodlaender et al. in 2015 to obtained $2^{O(k)}\cdot n$ time algorithms, $k$ the treewidth of the input graph, for a wide range of connectivity problems.

The $d$-neighbor equivalence is a tools introduced by Bui-Xuan et al. in 2013 to obtained efficient parameterized algorithms for many width measures (clique-width, rank-width, mim-width,…) and for many problems with a locally checkable constraint (Dominating Set, Independent Set,…).

By combining these two notions, we obtain efficient algorithms for several connectivity problems such as Connected Dominating Set, Node Weighted Steiner Tree, Maximum Induced Tree, Longest Induced Path, and Feedback Vertex Set. For all these problems, we obtain $2^{O(k)}\cdot n^{O(1)}$, $2^{O(k \log(k))}\cdot n^{O(1)}$, $2^{O(k^2)}\cdot n^{O(1)}$ and $n^{O(k)}$ time algorithms parameterized respectively by clique-width, $\mathbb{Q}$-rank-width, rank-width and maximum induced matching width. Our approach simplifies and unifies the known algorithms for each of the parameters and match asymptotically also the best time complexity for Vertex Cover and Dominating Set.

Paper available on HAL :

Distributed algorithms and graphs
Tuesday December 11, 2018, 2PM, Salle 3052
Riste Škrekovski (University of Ljubljana) Some results and problems on unique-maximum colorings of plane graphs

A \textit{unique-maximum} coloring of a plane graph is a proper vertex coloring by natural numbers where on each face $\alpha$ the maximal color appears exactly once on the vertices of $\alpha$. Fabrici and G\“{o}ring proved that six colors are enough for any plane graph and conjectured that four colors suffice. Thus, this conjecture is a strengthening of the Four Color Theorem. Wendland later decreased the upper bound from six to five.

We first show that the conjecture holds for various subclasses of planar graphs but then we disprove it for planar graphs in general. So, we conclude that the facial unique-maximum chromatic number of the sphere is not four but five.

Additionally, we will consider a facial edge-coloring analogue of the aforementioned coloring, and we will conclude the talk with various open problems.

(Joint work with Vesna Andova, Bernard Lidick\'y, Borut Lu\v{z}ar, and Kacy Messerschmidt)

Distributed algorithms and graphs
Thursday November 29, 2018, 2PM, Salle 3014
Carenne Ludeña (Universidad Jose Tadeo Lozano) A random graph model based on the Modular decomposition of graphs

We consider Gallai's graph Modular Decomposition theory for network analytics. On the one hand, by arguing that this is a choice tool for understanding structural and functional similarities among nodes in a network. On the other, by proposing a model for random graphs based on this decomposition. Our approach establishes a well defined context for hierarchical modeling and provides a solid theoretical framework for probabilistic and statistical methods. Theoretical and simulation results show the model acknowledges scale free networks, high clustering coefficients and small diameters all of which are observed features in many natural and social networks.

Distributed algorithms and graphs
Tuesday November 27, 2018, 2PM, Salle 3052
Miguel Mendez Set operads and decomposition theory

Informally, a set operad is a family of combinatorial structures plus 1) an (associative) mechanism that creates larger structures from smaller using as assembler an external structure in the same family 2) Identity structures over singleton sets. We give the precise definition of set operads in the context of Joyal’s combinatorial species. Interesting examples of set operads are Graphs, directed graphs, posets, Boolean functions, monotone Boolean functions, simple multiperson games, simplicial complexes, etc. We show that Decompositions theory of combinatorial structure can be formulated in the general context of set operads by using the operation of amalgam (coproduct) of operads.

Distributed algorithms and graphs
Tuesday October 23, 2018, 2PM, Salle 3052
Yllka Velaj (CWI Amsterdam) Stable Outcomes in Modified Fractional Hedonic Games

In coalition formation games, self-organized coalitions are created as a result of the strategic interactions of independent agents. For each couple of agents $(i,j)$, weight $w_{i,j}=w_{j,i}$ reflects how much agents $i$ and $j$ benefit from belonging to the same coalition. We consider the modified fractional hedonic game, that is a coalition formation game in which agents' utilities are such that the total benefit of agent $i$ belonging to a coalition (given by the sum of $w_{i,j}$ over all other agents $j$ belonging to the same coalition) is averaged over all the other members of that coalition, i.e., excluding herself. Modified fractional hedonic games constitute a class of succinctly representable hedonic games.

We are interested in the scenario in which agents, individually or jointly, choose to form a new coalition or to join an existing one, until a stable outcome is reached. To this aim, we consider common stability notions, leading to strong Nash stable outcomes, Nash stable outcomes or core stable outcomes: we study their existence, complexity and performance, both in the case of general weights and in the case of 0-1 weights.

Distributed algorithms and graphs
Tuesday May 22, 2018, 2PM, Salle 1007
François Pirot (Université de Strasbourg) Fractional chromatic number of small degree graphs and girth.

It is well known that you can color a graph G of maximum degree d greedily with d+1 colors. Moreover, this bound is tight, since it is reached by the cliques. Johansson proved with a pseudo-random coloring scheme that you can color triangle-free graphs of maximum degree d with no more than O(d/log d) colors. This result has been recently improved to (1+ε)(d/log d) for any ε>0 when d is big enough. This is tight up to a multiplicative constant, since you can pseudo-randomly construct a family of graphs of maximum degree d, arbitrary large girth, and chromatic number bigger than d / (2 log d). Although these are really nice results, they are only true for big degrees, and there remains a lot to say for small degree graphs. When the graphs are of small degree, it is interesting to consider the fractional chromatic number instead, since it has infinitely many possible values – note that cubic graphs are either bipartite, the clique K4, or of chromatic number 3. It has already been settled that the maximum fractional chromatic number over the triangle-free cubic graphs is 14/5. I will present a systematic method to compute upper bounds for the independence ratio of graphs of given (small!) degree and girth, which can sometimes lead to upper bounds for the fractional chromatic number, and can be adapted to any family of small degree graphs under some local constraints.

Distributed algorithms and graphs
Friday April 6, 2018, 10AM, Salle 3052
Cédric Bentz Steiner trees with edge capacities.

Abstract : Assume we are given a graph G=(V,E) (directed or not) with capacities and costs on the edges, a vertex r of G called root, and a set X of terminal vertices. The problem we consider is the following: find in G a minimum-cost tree rooted at r, spanning all the vertices in X, and such that, for each edge of this tree, the number of paths going from r to terminals and containing this edge does not exceed its capacity. When all capacities are at least |X|, then this is the classical Steiner tree problem, with a given root. The generalization we are interested in has several relevant applications, including the design of wind farm collection networks. We study the complexity of this problem in different settings: for instance, the graph may be directed or not, |X| may be fixed or not, the costs may be 0 or not. Whenever this is possible, we also design approximation algorithms to solve the problem.

Distributed algorithms and graphs
Tuesday April 3, 2018, 2PM, Salle 1007
Marcin Kaminski Induced minors and well-quasi-ordering

A graph H is an induced minor of a graph G if it can be obtained from an induced subgraph of G by contracting edges. Otherwise, G is said to be H-free.

We show that the class of H-free graphs is well-quasi-ordered by induced minors if and only if H is an induced minor of the gem (=the path on 4 vertices plus a dominating vertex) or the graph obtained by adding a vertex of degree 2 to the K4 (= the complete graph on 4 vertices).

This generalizes a a result of Robin Thomas who proved that K4-free graphs are well-quasi-ordered by induced minors and complements similar dichotomy theorems proved by Guoli Ding for subgraphs and Peter Damaschke for induced subgraphs.

This is joint work with Jarosław Błasiok, Jean-Florent Raymond, and Théophile Trunck.

Distributed algorithms and graphs
Tuesday March 27, 2018, 2PM, Salle 1007
Matej Stehlik (Université Grenoble Alpes - GSCOP) Nombre chromatique et la méthode topologique

La méthode topologique est la seule méthode connue pour déterminer le nombre chromatique de certaines classes de graphes, et un problème classique est d’obtenir des preuves alternatives plus élémentaires. Après une brève introduction à la méthode topologique, je présenterai certains de mes travaux qui y sont liés et j’expliquerai pourquoi le recours à la topologie est parfois difficilement évitable.

Distributed algorithms and graphs
Tuesday March 20, 2018, 2PM, Salle 1007
Pierluigi Crescenzi (Universite de Pise) Computing node centrality in large graphs: from theory to practice and back

The computation of several graph measures, based on the distance between nodes, is very often part of the analysis of real-world complex networks. The diameter, the betweenness and the closeness centrality, and the hyperbolicity are typical examples of such measures. In this talk, we will focus on the computation of one specific measure, that is, the node closeness centrality which is basically the inverse of the average distance of a node from all other nodes of the graph. Even though polynomial-time algorithms are available for the computation of this measure, in practice these algorithms are not useful, due to the huge size of the networks to be analysed. One first theoretical question is, hence, whether better algorithms can be designed, whose worst-case complexity is (almost) linear in the size of the input graph. We will first show that, unfortunately, for the closeness centrality no such algorithm exists (under reasonable complexity theory assumptions). This will lead us back to the practical point of view: we will then describe a heuristics that allows us to compute the above measure in (practical) linear time, even though its worst-case complexity is (in practice) intractable. This result will finally motivate our return to theory in order to understand the reason why, in practice, this heuristics works so well: we will indeed conclude by showing that, in the case of several random graph generating models, the average time complexity of the heuristics is indeed (almost) linear. This talk will summarise the research work that I have done in collaboration with Elisabetta Bergamini, Michele Borassi, Michel Habib, Andrea Marino, Henning Meyerhenke, and Luca Trevisan, and will be mostly based on two papers presented at ALENEX 2016, and SODA 2017.

Distributed algorithms and graphs
Tuesday March 13, 2018, 2PM, Salle 1007
Mamadou Kante (ISIMA) Obstructions pour certaines classes de matroides linéaires

Savoir qu’une classe de structures est caractérisée par une liste finie d’obstructions n’est pas toujours satisfaisante pour reconnaître les membres de la classe et il est souvent désirable pour un algorithme de reconnaissance de fournir un certificat de non appartenance. Dans cet exposé, j’expliquerai quelques aspects de mes travaux sur le calcul des obstructions pour certaines classes de matroides.

Distributed algorithms and graphs
Tuesday February 27, 2018, 2PM, Salle 1007
Dieter Mitsche (Université Nice) Aspects des Graphes Aléatoires

Dans cet exposé j'expliquerai plusieurs de mes travaux sur différents modèles de graphes aléatoires : en particulier, je vais expliquer les périodes de connexité d'un modèle dynamique des graphes géométriques Euclidiens, la rigidité et l'orientabilité du graphe G(n,p), et je parlerai (de résultats sur) des graphes aléatoires hyperboliques et d'applications pour des grands réseaux.

Distributed algorithms and graphs
Tuesday February 20, 2018, 2PM, Salle 1007
Jan Arne Telle (University of Bergen) Width parameters of graphs and structured graph classes

Tree-width and clique-width are well-known graph parameters of algorithmic use. Clique-width is a stronger parameter in the sense that it is bounded on more classes of graphs. In this talk we will present an even stronger graph parameter called mim-width (maximum induced matching-width). Several nicely structured graphs, like interval graphs, permutation graphs and leaf power graphs, have mim-width 1. Given a decomposition of bounded mim-width of a graph G we can solve many interesting problems on G in polynomial time. We will mention also a yet stronger parameter, sim-width (special induced matching-width), of value 1 even for chordal and co-comparability graphs.

Parts of the talk are based on joint work with O.Kwon and L.Jaffke, to appear at STACS 2018.

Distributed algorithms and graphs
Monday February 12, 2018, 2PM, Salle 3052
Nabil Mustafa (ESIEE) Local Search for Geometric Optimization Problems.

Local-search is an intuitive approach towards solving combinatorial optimization problems: start with any feasible solution, and try to improve it by local improvements. Like other greedy approaches, it can fail to find the global optimum by getting stuck on a locally optimal solution. In this talk I will present the ideas and techniques behind the use of local-search in the design of provably good approximation algorithms for some combinatorial problems, such as independent sets, vertex cover, dominating sets in geometric intersection graphs. The key unifying theme is the analysis of local expansion in planar graphs. Joint work with Norbert Bus, Shashwat Garg, Bruno Jartoux and Saurabh Ray.

Year 2017

Distributed algorithms and graphs
Tuesday December 12, 2017, 2PM, Salle 3052
Jean Krivine (IRIF) Incremental Update for Graph Rewriting

Graph rewriting formalisms are well-established models for the representation of biological systems such as protein-protein interaction networks. The combinatorial complexity of these models usually prevents any explicit representation of the variables of the system, and one has to rely on stochastic simulations in order to sample the possible trajectories of the underlying Markov chain. The bottleneck of stochastic simulation algorithms is the update of the propensity function that describes the probability that a given rule is to be applied next. In this talk we present an algorithm based on a data structure, called extension basis, that can be used to update the counts of predefined graph observables after a rule of the model has been applied.

Reference: Boutillier P., Ehrhard T., Krivine J. (2017) Incremental Update for Graph Rewriting. In: Yang H. (eds) Programming Languages and Systems. ESOP 2017. Lecture Notes in Computer Science, vol 10201. Springer, Berlin, Heidelberg

Séminaire commun du pole Algorihtmes et Structures Discrètes.

Distributed algorithms and graphs
Tuesday October 17, 2017, 2PM, Salle 3052
Claire Mathieu (DI - ENS) Online k-compaction

Given, at each time t = 1, 2, …, n, a new file of length l(t) and a read rate r(t), an online k-compaction algorithm must maintain a collection of at most k files, choosing (at each time t, without knowing future inputs) some of the files to merge into one, thereby incurring a merge cost equal to the total length of the merged files and a read cost equal to the read rate r(t) times the number of files present at time t. The goal is to minimize the total cost over time. K-compaction algorithms are a key component of log-structured merge trees, the file-based data structure underlying NoSQL databases such as Accumulo, Bigtable, Cassandra, HBase,and others. We initiate the theoretical study of k-compaction algorithms. We formalize the problem, consider worst-case, average-case and competitive analysis (per-instance optimality), and propose new algorithms that are optimal according to these metrics.

This is joint work with Carl Staelin, Neal E. Young, and Arman Yousefi.

Distributed algorithms and graphs
Tuesday September 26, 2017, 2PM, Salle 1007
Jara Uitto (ETH Zurich) Tight Lower Bounds for the Cops and Robbers Game

For the game of cops and robbers, it is known that in 1-cop-win graphs, the cop can capture the robber in O(n) time and that there exist graphs in which this capture time is tight. When k ≥ 2, a simple counting argument shows that in k-cop-win graphs, the capture time is at most O( n^(k+1) ), however, no non-trivial lower bounds were previously known; indeed, in their 2011 book, Bonato and Nowakowski ask whether this upper bound can be improved. We answer the question of Bonato and Nowakowski on the negative, proving that the O(n^(k+1) ) bound is asymptotically tight for any constant k ≥ 2. This yields a surprising gap in the capture time complexities between the 1-cop and the 2-cop cases.

Distributed algorithms and graphs
Tuesday September 12, 2017, 2PM, Salle 1007
Mor Perry Aspects of Distributed Verification

In this talk, we focus on two different aspects of verification of boolean predicates over distributed networks. Given a network configuration, the proof-labeling scheme (PLS) model defines a distributed proof in the form of a label that is given to each node, and all nodes locally verify that the network configuration satisfies the desired boolean predicate by exchanging labels with their neighbors. The complexity measure of the scheme, a.k.a. the proof size, is defined to be the maximum size of a label.

1. Space-time tradeoffs for distributed verification, joint work with Rafail Ostrovsky and Will Rosenbaum. In this work, we introduce the notion of a t-PLS, which allows the verification procedure to run for super-constant time. Our work analyzes the tradeoffs of t-PLS between time, label size, message length, and computation space. We construct a universal t-PLS and prove that it uses the same amount of total communication as a known one-round universal PLS, and t factor smaller labels. In addition, we provide a general technique to prove lower bounds for space-time tradeoffs of t-PLS. We use this technique to show an optimal tradeoff for testing that a network is acyclic (cycle free). Our optimal t-PLS for acyclicity uses proof size, message size and computation space O( ( log n)/t).

2. Approximate proof-labeling schemes, joint work with Keren Censor-Hillel and Ami Paz. In this work we extend the PLS model by defining the approximate PLS (APLS) model. In this new model, the predicates for verification are of the form f(G)\le f'(G), where f, f': F → N for a family of configurations F and the set of natural numbers N. Informally, the predicates considered in this model are a comparison between two values of the configuration. As in the PLS model, nodes exchange labels in order to locally verify the predicate, and all must accept if the network satisfies the predicate. The soundness condition is relaxed with an approximation ration alpha, so that only if f(G) > alpha*f'(G) some node must reject. We show that in the APLS model, the proof size can be much smaller than the proof size of the same predicate in the PLS model. Moreover, we prove that there is a tradeoff between the approximation ratio and the proof size.

Distributed algorithms and graphs
Tuesday June 20, 2017, 2PM, Salle 1007
Siddarth Gupta A Topological Algorithm for Determining How Road Networks Evolve Over Time

We provide an efficient algorithm for determining how a road network has evolved over time, given two snapshot instances from different dates. To allow for such determinations across different databases and even against hand drawn maps, we take a strictly topological approach in this paper, so that we compare road networks based strictly on graph-theoretic properties. Given two road networks of same region from two different dates, our approach allows one to match road network portions that remain intact and also point out added or removed portions. We analyze our algorithm both theoretically, showing that it runs in polynomial time for non-degenerate road networks even though a related problem is NP-complete, and experimentally, using dated road networks from the TIGER/Line archive of the U.S. Census Bureau.

Can you tell me how long should be the talk?

Distributed algorithms and graphs
Tuesday June 13, 2017, 2PM, Salle 1007
Afshin Behmaram Matching and covering in cubic graphs

In this talk, i will present first some theorems and observations about matching in cubic graphs and about covering the edges of cubic graphs by perfect matchings. Then I will present some interesting open problems in this area.

Distributed algorithms and graphs
Tuesday May 2, 2017, 2PM, Salle 1007
Pierre Aboulker (ULB) From chromatic number to dichromatic number

A k-dicolouring of a digraph is a partition of its vertex setinto k acyclic subdigraphs. The dichromatic number of a digraph D is the minimum k such that D has a k-dicolouring.

We first give some properties related to the dichromatic number in order to show why and how it generalizes the chromatic number of non-oriented graphs. Then we investigate the following questions: What can we say about subgraphs, induced subgraphs and topological minors of a digraph with large dichromatic number?

Distributed algorithms and graphs
Tuesday April 25, 2017, 2PM, Salle 1007
Mike Molloy (University of Toronto and Ecole Normale Superieure Paris) Entropy Compression and the Lovasz Local Lemma

The Lovasz Local Lemma, a cornerstone of the probabilistic method, is a powerful and widely used proof technique. In 2009, Moser introduced a technique called entropy compression to provide efficient algorithms which construct objects that the Local Lemma guarantees to exist. Recently, entropy compression has been used to develop more powerful versions of the Local Lemma which provide existence proofs in settings where the original Local Lemma does not apply. I will illustrate this technique with applications to graph colouring: (a) colouring triangle-free graphs, and (b) frugal colouring, where no colour can appear too many times in any neighbourhood.

Distributed algorithms and graphs
Tuesday April 18, 2017, 2PM, Salle 1007
Mikael Rabie (LIX) Time and Homonyms Considerations over Community Protocols

Guerraoui and Ruppert introduced the model of Community Protocols. This Distributed System works with agents having a finite memory and unique identifiers (the set of identifiers being ordered). Each agent can store a finite number of identifiers they heard about. The interactions are asynchronous and pairwise, following a fair scheduler. The computation power of this model is fully characterized: it corresponds exactly to what non deterministic Turing Machines can compute on a space O(n\log n). In this talk, I will focus on two restrictions of the model: The first is what happens when agents may share identifiers, the population admitting homonyms. I will introduce a hierarchy, with characterizations depending on the rate of unique identifiers present in the population. The main result is that with log n identifiers, a Turing Machine with a polylogarithmic space can be simulated. The second considers the following time restriction: what can be computed in a polylogarithmic number of parallel interactions. This version is not yet characterized, but I will provide some impossibility results, some computable protocols, and I will give the tighter bound we found.

Distributed algorithms and graphs
Tuesday April 4, 2017, 2PM, Salle 1007
Valentin Garnero (INRIA Sophia Antipolis) (Méta)-noyaux constructifs et linéaires dans les graphes peu denses

Dans cet exposé je vous présenterai les résultats obtenus au cours de ma thèse, laquelle traite de noyaux et de complexité paramétrée. La complexité paramétrée est une branche de l'algorithmie qui analyse la complexité d'un problème en fonction de la taille des données n et d'un paramètre k (arbitraire). L'objectif est de pouvoir attaquer des problèmes difficiles (NPc) et de montrer que l’exposition combinatoire n'est fonction que du paramètre (et pas de la taille des données), cad, trouver des algorithmes en f(k)+p(n). L'extraction de noyau est une méthode qui permet d'obtenir des algorithmes avec un telle complexité. Il s'agit d'un pré-calcul (une réduction polynomiale) qui réduit la taille des données en temps polynomial, tout en garantissant que la taille du noyau (l'instance réduite) est bornée par une fonction du paramètre g(k). Il suffit de résoudre le problème dans le noyau, de n'importe quelle façon, pour obtenir un algorithme en f(g(k)) + p(n).

La méthode de décomposition en régions [Alber, Fellows, Niedermeier] est un résultat majeur dans le domaine des noyaux. Elle a permis de construire de nombreux noyaux linaires pour des variantes de la Domination dans les graphes planaires. J'illustrerai cette méthode avec le cas de la Domination Rouge Bleu, qui consiste à trouver, dans un graphe bicoloré, un ensemble de sommets bleus tel que tous les sommets rouges sont à distance au plus 1 de la solution.

Cette méthode a ensuite été généralisée par des méta-résultats [ex: Bodlaender, Fomin, Lokshtanov, Penninkx, Saurabh, Thilikos], qui prouve l'existence de noyaux (dans des graphes peu denses) pour tout problème vérifiant certaines conditions génériques. Je présenterai un de ses méta-résultats, qui se base sur la programmation dynamique et sur la décomposition en protrusion, et qui a le mérite d’être constructif.

Distributed algorithms and graphs
Tuesday March 28, 2017, 2PM, Salle 1007
Juho Hirvonen (IRIF) Recent developments in the theory of distributed graph algorithms

I will survey and try to explain the intuition behind several recent developments in the theory of distributed graph algorithms. I will focus on the LOCAL model, where the measure of interest is how far information has to be propagated in a communication network in order solve a given problem. The problems of interest will be locally checkable labelling problems (LCLs), a natural class of problems that allow distributed verification of proposed solutions.

I will discuss two recent papers in this field. First, we gave a lower bound showing that there exist LCL problems of ”intermediate” complexity, that is, complexity strictly between known complexity classes (Brandt et al., STOC 2016). The proof is by a new kind of simulation argument. Second, Chang et al. (FOCS 2016) showed that this lower bound implies an exponential separation between the randomized and deterministic LOCAL models. Chang et al. also show further connections between the randomized and deterministic models, and establish a useful speed-up simulation for the deterministic LOCAL model.

Distributed algorithms and graphs
Tuesday March 21, 2017, 2PM, Salle 1007
Evangelos Bampas (LIF - Université Aix Marseille) Linear search by a pair of distinct-speed robots

We will present algorithms for the evacuation problem by a pair of distinct-speed robots on an infinite line. In this problem, two mobile robots with different maximal speeds are initially placed at the same point on an infinite line. The robots need to find a stationary target (i.e., the exit), which is placed at an unknown location on the line. The search is completed when both robots arrive at the exit and the goal is to conclude evacuation in as little time as possible. The robot that discovers the exit first may communicate it to the other robot. We consider two models of communication between the robots, namely wireless communication and face-to-face communication. We present an optimal algorithm for any combination of robot speeds in the case of face-to-face communication. In the case of wireless communication, our algorithm is optimal if the slow robot is at most 6 times slower than the fast robot.

Distributed algorithms and graphs
Tuesday February 28, 2017, 2PM, Salle 1007
Laurent Viennot (INRIA - IRIF) Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons

Joint work with Adrian Kosowski

The goal of a hub-based distance labeling scheme for a network $G = (V, E)$ is to assign a small subset $S(u) \subseteq V$ to each node $u \in V$, in such a way that for any pair of nodes $u, v$, the intersection of hub sets $S(u) \cap S(v)$ contains a node on the shortest $uv$-path. The existence of small hub sets, and consequently efficient shortest path processing algorithms, for road networks is an empirical observation. A theoretical explanation for this phenomenon was proposed by Abraham et al. (SODA 2010) through a network parameter they called highway dimension, which captures the size of a hitting set for a collection of shortest paths of length at least $r$ intersecting a given ball of radius $2r$. In this talk, we revisit this explanation, introducing a more tractable (and directly comparable) parameter based solely on the structure of shortest-path spanning trees, which we call skeleton dimension. We show that skeleton dimension admits an intuitive definition for both directed and undirected graphs, provides a way of computing labels more efficiently than by using highway dimension, and leads to comparable or stronger theoretical bounds on hub set size.

Distributed algorithms and graphs
Tuesday February 7, 2017, 2PM, Salle 1007
Edouard Bonnet (Middlesex University, London) Fine-grained complexity of coloring geometric intersection graphs.

We are interested in the following problem: Given a collection of n objects in the plane and an integer k, is there a proper k-coloring of its intersection graph (i.e., such that two overlapping objects get different colors). Here we think of k as a function of n; it can be constant, linear, or anything in between. From an application of a known separator theorem, if the input objects are fat (i.e., have bounded diameter/width ratio), then this problem can be solved in time 2^{O(\sqrt{n k} \log n)}. We will show that this running time is essentially optimal under the Exponential Time Hypothesis (ETH). We then move to intersection graphs of segments (which are quintessentially non fat) and show that the situation is quite different than with fat objects. We end on a surprising note: 3-coloring and 4+-coloring of segments have significantly different behaviors.

The guideline and motivation of the talk is to go beyond the NP-hardness of coloring those geometric graphs, and precise what is the best (hopefully subexponential) running time that we can get.

This is based on a joint work with Csaba Biró, Dániel Marx, Tillmann Miltzow, and Paweł Rzążewski, and an ongoing project with Stéphan Thomassé and a subset of the aforementioned authors.

Distributed algorithms and graphs
Tuesday January 24, 2017, 2PM, Salle 1007
Maximilien Danisch (Telecom Paris Tech) Towards real-world graph algorithmics

Real-world graphs (a.k.a. complex networks) are ubiquitous: the web, Facebook, Twitter, brain networks, protein interaction networks, etc. Studying these graphs and solving computational problems on them (say maximum clique, partitioning or dense subgraph) has applications in many fields. I will first show that the structure of some real-world graphs is special. In particular, they are not adversarial and some difficult problems (say NP-complete or NP-hard problems) can be solved on some huge real-world graphs (say 2G edges or more). I will then present two works along the lines of “understanding and leveraging the structure of real-world graphs in order to build better algorithms”: (i) Enumerating all k-cliques and (ii) Computing the density-friendly graph decomposition.

Distributed algorithms and graphs
Tuesday January 10, 2017, 2PM, Salle 1007
Carl Feghali (IRIF) Problems and Results in Kempe Equivalence of Colorings

Given a graph G with a coloring, a Kempe chain of G is a maximal connected subgraph of G in which each vertex has one of two colors. A Kempe change is the operation of swapping the colors of a Kempe chain. Two colorings are Kempe equivalent if one can be obtained from the other by a sequence of Kempe changes. In this talk, we survey some of the existing results, open problems and common proof techniques in this area.

Distributed algorithms and graphs
Tuesday January 3, 2017, 2PM, Salle 1007
Marthe Bonamy (Labri - CNRS) Reed's conjecture and strong edge coloring

The chromatic number of a graph is trivially bounded from above by the maximum degree plus one, and from below by the size of a largest clique. Reed proved in 1998 that compared to the trivial upper bound, we can always save a number of colors proportional to the gap between the maximum degree and the size of a largest clique. A key step in the proof deals with how to spare colors in a graph whose every vertex “sees few edges” in its neighborhood. We improve the existing approach, and discuss its applications to Reed's theorem and strong edge coloring.

This is joint work with Thomas Perrett (Technical University of Denmark) and Luke Postle (University of Waterloo).

Year 2016

Distributed algorithms and graphs
Tuesday December 13, 2016, 2PM, Salle 1007
Hang Zhou (Max Planck Institute for Informatics) Graph Reconstruction and Verification

How efficiently can we find an unknown graph using shortest path queries between its vertices? This is a natural theoretical question from the standpoint of recovery of hidden information. This question is related to discovering the topology of Internet networks, which is a crucial step for building accurate network models and designing efficient algorithms for Internet applications.

In this talk, I will introduce the problems of graph reconstruction and verification via oracles. I will investigate randomized algorithms based on a Voronoi cell decomposition. I will also analyze greedy algorithms, and prove that they are near-optimal.

The talk is based on joint work with Claire Mathieu and Sampath Kannan.

Distributed algorithms and graphs
Tuesday November 29, 2016, 2PM, Salle 1007
Michel Habib (IRIF) Cocomparability graphs and greedy algorithms

Joint work with Derek Corneil, Jérémie Dusart and Ekkehard Kh\“oler

A cocomparability graph is a graph whose complement admits a transitive orientation. An interval graph is the intersection graph of a family of intervals on the real line. In this paper we investigate the relationships between interval and cocomparability graphs. I will first present some recent algorithms we obtained on cocomparability graphs. They show that for some problems, the algorithm used on interval graphs can also be used with small modifications on cocomparability graphs. Many of these algorithms are based on graph searches that preserve cocomparability orderings.

Then I will propose a characterization of cocomparability graphs via a lattice structure on the set of their maximal cliques. Using this characterization we can prove that every maximal interval subgraph of a cocomparability graph $G$ is also a maximal chordal subgraph of $G$.

This characterization also has interesting algorithmic consequences and we show that a new graph search, namely Local Maximal Neighborhood Search (LocalMNS) leads to an $O(n+mlogn)$ time algorithm to find a maximal interval subgraph of a cocomparability graph. Similarly I propose a linear time algorithm to compute all simplicial vertices in a cocomparability graph. In both cases we improve on the current state of knowledge.

Distributed algorithms and graphs
Tuesday October 25, 2016, 2PM, Salle 1007
Jonas Lefevre (IRIF) Self-stabilizing Metric Graphs

Je présenterai un algorithme autostabilisant pour réseaux overlay construisant le graphe d'une métrique donnée par oracle. L'algorithme fonctionne sous les daemons synchrones et asynchrones. Sous daemon synchrone le temps de convergence est linéaire. Dans tout les cas, la complexité en messages et celle en mémoire sont aussi faibles que possible. Cette construction peut être utilisée pour construire pour de la construction d'un graphe arbitraire.

Distributed algorithms and graphs
Tuesday September 27, 2016, 2PM, Salle 1007
Ha Duong Phan (Institute of Mathematics, VAST, Vietnam.) Algorithms for computing the rank of divisors on some classes of graphs.

The notion of rank of divisor on graph was introduced by Baker and Norine in 2007 in showing the link with the similar notion on Riemann surface. Moreover, the authors have developed a theorem for divisors on graph analogue to the classical Riemann-Roch theorem. Since then, many works have studied for computing the rank of divisors on graph. A very important is the new theorem on the NP-hardness complexity of the Problem of computing the rank of divisor on general graph. The proof of this result was based on the proof of the NP-hardness of the Problem of finding the minimum recurrent configurations of Chip Firing Game on directed graphs (by Perrot and Pham). In this talk, we will present some (linear) algorithms for computing the rank of divisors on some classes of graphs.

Distributed algorithms and graphs
Thursday July 7, 2016, 10AM, Salle 1016
Eli Gafni (UCLA) The Role of Mantras in (Distributed-Computing) Research

A Research-Mantra is something “cosmic” one believes holds in the area of research at hand. It is then a “pillar of fire” in front that leads the way. The Mantra is to be followed as long as it is not refuted by facts.
In this talk I'll present some Mantras I followed during the years starting with one that says that Distributed-Computing Theory (DCT) is the Mathematical Study of Interleaving. Consequently, DCT researchers should have Mathematical sensibilities rather than Engineering ones. Thus, DCT should poses the beauty of Mathematics, and should not be be “hacked” as an Engineering Domain. In particular any paper that points to “anomalies” or “paradoxes” does not point to faults in the domain but to faults in the thinking of the authors. I'll show some Mantras I use and where they led, and I'll end up with the ramification of recent Mantra that holds that deterministic state-machines capture interleaving as well as message-passing interleaving.

(Attention jour horaire et salle inhabituels)

Distributed algorithms and graphs
Tuesday June 28, 2016, 2PM, Salle 1007
Janna Burman (LRI - Université Paris Sud) Space-Optimal Counting in Population Protocols

We study the fundamental problem of counting, which consists in computing the size of a system. The considered model are population protocols, which is the model of finite state, anonymous and asynchronous mobile devices (agents) communicating in pairs (according to a fairness condition). We significantly improve the previous results known for counting in this model, in terms of (exact) space complexity. Specifically, we give the first space optimal protocols solving the problem for two classical types of fairness, global and weak. Both protocols require no initialization of the counted agents. The protocol designed for global fairness, surprisingly, uses only one bit of memory (two states) per counted agent. The protocol, functioning under weak fairness, requires the necessary log P bits (P states, per counted agent) to be able to count up to P agents. Interestingly, this protocol exploits the intriguing Gros sequence of natural numbers, which is also used in the solutions to the Chinese Rings and the Hanoi Towers puzzles.

Distributed algorithms and graphs
Tuesday June 21, 2016, 2PM, Salle 1007
Qiang Sun (LRI) Locating any two vertices on Hamiltonian cycles

We give a proof of Enomoto's conjecture for graphs of sufficiently large order. Enomoto's conjecture states that: if G is a graph of order n with minimum degree at least n/2+ 1, then for any pair x,y of vertices of G, there is a Hamiltonian cycle C of G such that the distance between x and y in C is n/2.

The main tools of our proof are Regularity Lemma of Szemeredi and Blow-up Lemma of Koml os et al..

This is a joint work with Weihua He and Hao Li.

Distributed algorithms and graphs
Thursday June 9, 2016, 2PM, Salle 2015
Feodor Dragan (Kent State University) Tree-Like Structures in Graphs: A Metric Point of View

Recent empirical and theoretical work has suggested that many real-life complex networks and graphs arising in Internet applications, in biological and social sciences, in chemistry and physics have tree-like structures from a metric point of view. A number of graph parameters trying to capture this phenomenon and to measure these tree-like structures were proposed; most notable ones being the tree-stretch, tree-distortion, tree-length, tree-breadth, Gromov’s hyperbolicity of a graph, and cluster-diameter and cluster-radius in a layering partition of a graph. If such a parameter is bounded by a constant on graphs then many optimization problems can be efficiently solved or approximated for such graphs. We discuss these parameters and recently established relationships between them for unweighted and undirected graphs; it turns out that all these parameters are at most constant or logarithmic factors apart from each other. We give inequalities describing their relationships and discuss consequences for some optimization problems.

Distributed algorithms and graphs
Tuesday May 24, 2016, 2PM, Salle 1007
Eujung Kim To be announced.

Distributed algorithms and graphs
Tuesday May 17, 2016, 2PM, Salle 1007
Edita Rollova (University of West Bohemia, Pilsen, Czech republic) New proof of Seymour's 6-flow theorem

We will provide (two) new proof(s) of Seymour's 6-flow theorem (both) using induction.

Distributed algorithms and graphs
Tuesday April 12, 2016, 2PM, Salle 1007
Nicolas Schabanel Folding Turing is hard but feasible

Nicolas Schabanel, joint work with Cody Geary (Caltech), Pierre-Étienne Meunier (U. Aalto), et Shinnosuke Seki (U. Electro-Communications, Tokyo).

We introduce and study the computational power of Oritatami, a theoretical model to explore greedy molecular folding, by which the molecule begins to fold before waiting the end of its production. This model is inspired by our recent experimental work demonstrating the construction of shapes at the nanoscale by folding an RNA molecule during its transcription from an engineered sequence of synthetic DNA. While predicting the most likely conformation is known to be NP-complete in other models, Oritatami sequences fold optimally in linear time. Although our model uses only a small subset of the mechanisms known to be involved in molecular folding, we show that it is capable of efficient universal computation, implying that any extension of this model will have this property as well.

We introduce general design techniques for programming these molecules. Our main result in this direction is an algorithm in time linear in the sequence length, that finds a rule for folding the sequence deterministically into a prescribed set of shapes depending of its environment. This shows the corresponding problem is fixed-parameter tractable although we proved it is NP-complete in the number of possible environments. This algorithm was used effectively to design several key steps of our constructions.

Distributed algorithms and graphs
Tuesday April 5, 2016, 2PM, Salle 1007
Matteo Seminaroti Similarity-First Search: a new algorithm with application to Robinsonian matrix recognition

We present a new efficient combinatorial algorithm for recognizing if a given symmetric matrix is Robinsonian, i.e., if its rows and columns can be simultaneously reordered so that entries are monotone nondecreasing in rows and columns when moving toward the diagonal. As main ingredient we introduce a new algorithm, named Similarity-First-Search (SFS), which extends Lexicographic Breadth-First Search (Lex-BFS) to weighted graphs and which we use in a multisweep algorithm to recognize Robinsonian matrices. Since Robinsonian binary matrices correspond to unit interval graphs, our algorithm can be seen as a generalization to weighted graphs of the 3-sweep Lex-BFS algorithm of Corneil for recognizing unit interval graphs. This new recognition algorithm is extremely simple and, for an n×n nonnegative matrix with m nonzero entries, it terminates in n−1 SFS sweeps, with overall running time O(n^2+nmlogn).

Distributed algorithms and graphs
Tuesday March 29, 2016, 2PM, Salle 1007
Benjmain Momege Autour de la connexité dans les graphes avec conflits

Nous nous intéresserons aux graphes avec conflits (un conflit est une paire d'arêtes ne pouvant pas simultanément faire partie d'un sous-graphe), dans lesquels nous étudierons différents types de problèmes, de nature aussi bien algorithmique que combinatoire, notre ligne directrice étant la notion de connectivité. Nous verrons que plusieurs résultats, simples sans conflit, ne le sont plus lors de l'ajout de conflits. Nous présenterons : des algorithmes exacts (non polynomiaux), des résultats de NP-complétude, et des conditions suffisantes assurant l'existence de certains objets (arbre couvrant, chemin et cycle Hamiltonien) sans conflits.

Distributed algorithms and graphs
Tuesday February 9, 2016, 2PM, Salle 1007
Thomas Perrett (Technical University of Denmark) Roots of the chromatic polynomial, spanning trees and minors

The real and complex roots of chromatic polynomials, which we call chromatic roots, have been studied since the 1940s yet it is not well understood how structural properties of graphs affect their chromatic roots. In this talk we survey some results and open problems, and present recent work on the following question: For a minor- closed class of graphs, what is the infimum of the non-trivial real chromatic roots of the graphs in that class?

Distributed algorithms and graphs
Tuesday January 19, 2016, 2PM, Salle 1007
Sang-il Oum (KAIST) Variants of Hadwiger's conjecture

Hadwiger conjectured that every graph with no K_t minor is (t-1)-colorable; in other words, every graph with no K_t minor admits a partition of its vertex set into t-1 independent sets. This conjecture is still widely open and if true, it implies the four color theorem. Gerards and Seymour made a stronger conjecture claiming that every graph with no K_t odd minor is (t-1)- colorable, commonly called the odd Hadwiger's conjecture. We prove variants of Hadwiger's conjecture. First, we prove that every graph with no K_t minor admits a partition of its vertex set into t-1 sets, each inducing a subgraph of bounded maximum degree. Secondly, we prove that every graph with no K_t minor admits a partition of its vertex set into 3(t-1) sets, each inducing a subgraph having no large components.

We also prove variants of the odd Hadwiger's conjecture as follows: Every graph with no odd K_t minor admits a partition of its vertex set into 7t-10 sets, each inducing a subgraph of bounded maximum degree. As a corollary, we prove that every graph with no odd K_t minor admits a partition of its vertex set into 16t-19 sets, each inducing a subgraph with no large components. The last result improves the result of Kawarabayashi, who showed it with 496t sets.

This talk is a combination of three works; first with K. Edwards, D. Kang, J. Kim, and P. Seymour, second with C. Liu, and third with D. Kang.