Publication

Sequential metric dimension for random graphs

Related publications (113)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Multiview image coding using graph-based approach

Pascal Frossard, Thomas Maugey

In this paper, we design a new approach for coding the geometry information in a multiview image scenario. As an alternative to depth-based schemes, we propose a representation that captures the dependencies between pixels in different frames in the form o ...

2013

Extensions of a result of Elekes and Rónyai

Frank de Zeeuw

Many problems in combinatorial geometry can be formulated in terms of curves or surfaces containing many points of a cartesian product. In 2000, Elekes and Rónyai proved that if the graph of a polynomial f(x, y) contains cn2 points of an n × n × n cartesia ...

Elsevier2013

The simplicity of planar networks

Emanuele Strano, Marc Barthélemy

Shortest paths are not always simple. In planar networks, they can be very different from those with the smallest number of turns - the simplest paths. The statistical comparison of the lengths of the shortest and simplest paths provides a non trivial and ...

Nature Publishing Group2013

Effect Analysis for Programs with Callbacks

Viktor Kuncak, Etienne Kneuss, Philippe Paul Henri Suter

We introduce a precise interprocedural effect analysis for programs with mutable state, dynamic object allocation, and dynamic dispatch. Our analysis is precise even in the presence of dynamic dispatch where the context-insensitive estimate on the number o ...

Springer Berlin Heidelberg2013

Lower bounds on the obstacle number of graphs

János Pach, Doemoetoer Palvoelgyi, Padmini Mukkamala

Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices of G are joined by an edge if and only if the corresponding points can be con ...

2012

Graph Transformations preserving the stability number

Dominique de Werra

We analyze the relations between several graph transformations that were introduced to be used in procedures determining the stability number of a graph. We show that all these transformations can be decomposed into a sequence of edge deletions and twin de ...

Elsevier Science Bv2012

Graphs That Admit Polyline Drawings with Few Crossing Angles

Radoslav Fulek

We consider graphs that admit polyline drawings where all crossings occur at the same angle alpha is an element of (0, pi/2]. We prove that every graph on n vertices that admits such a polyline drawing with at most two bends per edge has O(n) edges. This r ...

2012

Graph-Based Information Processing

Amin Karbasi

We live in a world characterized by massive information transfer and real-time communication. The demand for efficient yet low-complexity algorithms is widespread across different fields, including machine learning, signal processing and communications. Mo ...

EPFL2012

Learning of Structured Graph Dictionaries

Pascal Frossard, Xiaowen Dong, Xue Zhang

We propose a method for learning dictionaries towards sparse approximation of signals defined on vertices of arbitrary graphs. Dictionaries are expected to describe effectively the main spatial and spectral components of the signals of interest, so that th ...

2012

Finite graphs and amenability

Gábor Elek

Hyperfiniteness or amenability of measurable equivalence relations and group actions has been studied for almost fifty years. Recently, unexpected applications of hyperfiniteness were found in computer science in the context of testability of graph propert ...

Academic Press Inc Elsevier Science2012