Publications related to Dijkstra's algorithm

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Adam Teodor Polak, Alexandra Anna Lassota

We solve the Bin Packing problem in O^*(2^k) time, where k is the number of items less or equal to one third of the bin capacity. This parameter measures the distance from the polynomially solvable case of only large (i.e., greater than one third) items. O ...

Schloss Dagstuhl – Leibniz-Zentrum fur Informatik2022

The power of adaptivity in source identification with time queries on the path

Patrick Thiran, Gergely Odor, Victor Cyril L Lecomte

We study the problem of identifying the source of a stochastic diffusion process spreading on a graph based on the arrival times of the diffusion at a few queried nodes. In a graph

G=(V,E)

, an unknown source node

v^* \in V

is drawn uniformly at random, ...

2022

Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

Viktor Kuncak, Simon Guilloud

We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho algorithm for tree isomo ...

Springer2022

HyperLogLog: Exponentially Bad in Adversarial Settings

Mathilde Aliénor Raynal

Computing the count of distinct elements in large data sets is a common task but naive approaches are memory-expensive. The HyperLogLog (HLL) algorithm (Flajolet et al., 2007) estimates a data set's cardinality while using significantly less memory than a ...

IEEE COMPUTER SOC2022

Variational dynamics as a ground-state problem on a quantum computer

Giuseppe Carleo, Stefano Barison, Filippo Vicentini

We propose a variational quantum algorithm to study the real-time dynamics of quantum systems as a ground -state problem. The method is based on the original proposal of Feynman and Kitaev to encode time into a register of auxiliary qubits. We prepare the ...

AMER PHYSICAL SOC2022

GaSLAM: An Algorithm for Simultaneous Gas Source Localization and Gas Distribution Mapping in 3D

Alcherio Martinoli, Chiara Ercolani, Lixuan Tang

Chemical gas dispersion poses considerable threat to humans, animals and the environment. The research areas of gas source localization and gas distribution mapping aim to localize the source of gas leaks and map the gas plume respectively, in order to hel ...

2022

A local adaptive discontinuous Galerkin method for convection-diffusion-reaction equations

Assyr Abdulle, Giacomo Rosilho De Souza

We introduce a local adaptive discontinuous Galerkin method for convection-diffusion-reaction equations. The proposed method is based on a coarse grid and iteratively improves the solution's accuracy by solving local elliptic problems in refined subdomains ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2022

Deploying an Instance Segmentation Algorithm to Implement Social Distancing for Prosthetic Vision

Silvestro Micera, Daniela De Luca

The COVID-19 pandemic outbreak is causing a dramatic worsening in the already complicated living conditions of blind and visually impaired individuals. Social distancing is the most effective strategy to limit virus spread, but is extremely difficult for b ...

IEEE2022

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.

The power of adaptivity in source identification with time queries on the path

Patrick Thiran, Gergely Odor, Victor Cyril L Lecomte

We study the problem of identifying the source of a stochastic diffusion process spreading on a graph based on the arrival times of the diffusion at a few queried nodes. In a graph

G=(V,E)

, an unknown source node

v^* \in V

is drawn uniformly at random, ...

2022

Dijkstra's algorithm

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

The power of adaptivity in source identification with time queries on the path

Geometrical Treatise on the Modelling of 3D Particulate Inclusion-Matrix Microstructures with an Application to Historical Stone Masonry Walls

Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

HyperLogLog: Exponentially Bad in Adversarial Settings

Rapid Scalable Distributed Power Flow with Open-Source Implementation

Variational dynamics as a ground-state problem on a quantum computer

GaSLAM: An Algorithm for Simultaneous Gas Source Localization and Gas Distribution Mapping in 3D

A local adaptive discontinuous Galerkin method for convection-diffusion-reaction equations

Deploying an Instance Segmentation Algorithm to Implement Social Distancing for Prosthetic Vision

Graph Chatbot

Chat with Graph Search

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Geometrical Treatise on the Modelling of 3D Particulate Inclusion-Matrix Microstructures with an Application to Historical Stone Masonry Walls

Variational dynamics as a ground-state problem on a quantum computer

Rapid Scalable Distributed Power Flow with Open-Source Implementation

HyperLogLog: Exponentially Bad in Adversarial Settings

The power of adaptivity in source identification with time queries on the path

Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

GaSLAM: An Algorithm for Simultaneous Gas Source Localization and Gas Distribution Mapping in 3D

A local adaptive discontinuous Galerkin method for convection-diffusion-reaction equations

Deploying an Instance Segmentation Algorithm to Implement Social Distancing for Prosthetic Vision