Avoiding long Berge cycles: the missing casesk=r+1 andk=r+2

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.

We examine the connection of two graph parameters, the size of a minimum feedback arcs set and the acyclic disconnection. A feedback arc set of a directed graph is a subset of arcs such that after deletion the graph becomes acyclic. The acyclic disconnecti ...

We summarize what we consider to be the two main limitations of the "Estimands for Recurrent Event Endpoints in the Presence of a Terminal Event" (Schmidli et al. 2022). First, the authors did not give detailed guidance on how to choose an appropriate esti ...

In this work we consider solutions to stochastic partial differential equations with transport noise, which are known to converge, in a suitable scaling limit, to solution of the corresponding deterministic PDE with an additional viscosity term. Large devi ...

Achieving reactive robot behavior in complex dynamic environments is still challenging as it relies on being able to solve trajectory optimization problems quickly enough, such that we can replan the future motion at frequencies which are sufficiently high ...

Wikipedia is the largest source of free encyclopedic knowledge and one of the most visited sites on the Web. To increase reader understanding of the article, Wikipedia editors add images within the text of the article's body. However, despite their widespr ...

We show in full generality the stability of optimal transport paths in branched transport: namely, we prove that any limit of optimal transport paths is optimal as well. This solves an open problem in the field (cf. Open problem 1 in the book Optimal trans ...

Queries to detect isomorphic subgraphs are important in graph-based data management. While the problem of subgraph isomorphism search has received considerable attention for the static setting of a single query, or a batch thereof, existing approaches do n ...

Graphs offer a simple yet meaningful representation of relationships between data. This representation is often used in machine learning algorithms in order to incorporate structural or geometric information about data. However, it can also be used in an i ...

We show that the finitely generated simple left orderable groups G(rho) constructed by the first two authors in Hyde and Lodha [Finitely generated infinite simple groups of homeomorphisms of the real line. Invent. Math. (2019), doi:10.1007/s00222-01900880- ...

Motivation: Accurate morphological models of brain vasculature are key to modeling and simulating cerebral blood flow in realistic vascular networks. This in silico approach is fundamental to revealing the principles of neurovascular coupling. Validating t ...

In the presence of plant-model mismatch, the estimation of plant gradients is key to the performance of measurement-based iterative optimization schemes. However, gradient estimation requires time-consuming experiments, wherein the plant is sequentially pe ...

In this thesis we give new algorithms for two fundamental graph problems. We develop novel ways of using linear programming formulations, even exponential-sized ones, to extract structure from problem instances and to guide algorithms in making progress. S ...

Let F be a graph. A hypergraph is called Berge-F if it can be obtained by replacing each edge in F by a hyperedge containing it. ...

This paper tackles the problem of novel view synthesis from a single image. In particular, we target real-world scenes with rich geometric structure, a challenging task due to the large appearance variations of such scenes and the lack of simple 3D models ...

The main goal of this paper is to formalize and explore a connection between chromatic properties of graphs defined by geometric representations and competitivity analysis of on-line algorithms. This connection became apparent after the recent construction ...

Consider a two-class classification problem where the number of features is much larger than the sample size. The features are masked by Gaussian noise with mean zero and covariance matrix Sigma, where the precision matrix Omega = Sigma(-1) is unknown but ...

Approximate graph matching (AGM) refers to the problem of mapping the vertices of two structurally similar graphs, which has applications in social networks, computer vision, chemistry, and biology. Given its computational cost, AGM has mostly been limited ...

This thesis is devoted to crossing patterns of edges in topological graphs. We consider the following four problems: A thrackle is a graph drawn in the plane such that every pair of edges meet exactly once: either at a common endpoint or in a proper crossi ...

In a drawing of a graph, two edges form an odd pair if they cross each other an odd number of times. A pair of edges is independent if they share no endpoint. For a graph G, let ocr(G) be the smallest number of odd pairs in a drawing of G and let iocr(G) b ...

Avoiding long Berge cycles: the missing casesk=r+1 andk=r+2

Chat with Graph Search

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al

We Need Subject Matter Expertise to Choose and Identify Causal Estimands: Comment on "Estimands for Recurrent Event Endpoints in the Presence of a Terminal Event"

LDP and CLT for SPDEs with transport noise

VP-STO: Via-point-based Stochastic Trajectory Optimization for Reactive Robot Behavior

A large scale study of reader interactions with images on Wikipedia

On the Well-Posedness of Branched Transportation

Efficient Streaming Subgraph Isomorphism with Graph Neural Networks

Representing graphs through data with learning and optimal transport

Uniformly perfect finitely generated simple left orderable groups

Interactive visualization and analysis of morphological skeletons of brain vasculature networks with VessMorphoVis

Fast and Accurate Efficient Streaming Subgraph Isomorphism

A note on efficient computation of privileged directions in modifier adaptation

New Graph Algorithms via Polyhedral Techniques

Asyrnptotics for the Turan number of Berge-K-2,K-t

Geometry-aware Deep Network for Single-Image Novel View Synthesis

Coloring Relatives of Interval Overlap Graphs via On-line Games

Optimal Classification In Sparse Gaussian Graphic Model

A Bayesian Method for Matching Two Similar Graphs without Seeds

Intersection Patterns of Edges in Topological Graphs

Adjacent Crossings Do Matter