Publications related to Homeomorphism (graph theory)

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.

Tree-cotree decomposition of isogeometric mortared spaces in H(curl) on multi-patch domains

Bernard Kapidani, Rafael Vazquez Hernandez

When applying isogeometric analysis to engineering problems, one often deals with multi-patch spline spaces that have incompatible discretisations, e.g. in the case of moving objects. In such cases mortaring has been shown to be advantageous. This contribu ...

ELSEVIER SCIENCE SA2022

Scalable Robust Graph Embedding with Spark

Karl Aberer, Quoc Viet Hung Nguyen, Chi Thang Duong, Trung-Dung Hoang

Graph embedding aims at learning a vector-based representation of vertices that incorporates the structure of the graph. This representation then enables inference of graph properties. Existing graph embedding techniques, however, do not scale well to larg ...

ASSOC COMPUTING MACHINERY2021

Active Subdivision Surfaces for the Semiautomatic Segmentation of Biomedical Volumes

Michaël Unser, Anaïs Laure Marie-Thérèse Badoual

We present a new family of active surfaces for the semiautomatic segmentation of volumetric objects in 3D biomedical images. We represent our deformable model by a subdivision surface encoded by a small set of control points and generated through a geometr ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Extrapolating Paths with Graph Neural Networks

Andreas Loukas, Jean-Baptiste Francis Marie Juliette Cordonnier

We consider the problem of path inference: given a path prefix, i.e., a partially observed sequence of nodes in a graph, we want to predict which nodes are in the missing suffix. In particular, we focus on natural paths occurring as a by-product of the int ...

IJCAI, Inc.2019

Thrackles: An improved upper bound

János Pach, Radoslav Fulek

A thrackle is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are defined similarly, ex ...

ELSEVIER SCIENCE BV2019

Many disjoint edges in topological graphs

Andres Jacinto Ruiz Vargas

A monotone cylindrical graph is a topological graph drawn on an open cylinder with an infinite vertical axis satisfying the condition that every vertical line intersects every edge at most once. It is called simple if any pair of its edges have at most one ...

Elsevier Science Bv2017

Scaling a Reliable Distributed System

Alexandre David Olivier Maurer

We consider the problem of reliably connecting an arbitrarily large set of computers (nodes) with communication channels. Reliability means here the ability, for any two nodes, to remain connected (i.e., their ability to communicate) with probability at le ...

LPD EPFL2016

Saturated simple and k-simple topological graphs

János Pach, Jan Kyncl

A simple topological graph G is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. G is called saturated if no further edge can be added without violating this condition. ...

Elsevier Science Bv2015

Homeomorphism (graph theory)

Graph Chatbot

Chat with Graph Search

Tree-cotree decomposition of isogeometric mortared spaces in H(curl) on multi-patch domains

Scalable Robust Graph Embedding with Spark

Active Subdivision Surfaces for the Semiautomatic Segmentation of Biomedical Volumes

Extrapolating Paths with Graph Neural Networks

Thrackles: An improved upper bound

Many disjoint edges in topological graphs

Simple topological graphs

Scaling a Reliable Distributed System

Empty Triangles in Complete Topological Graphs

Saturated simple and k-simple topological graphs

Scalable Robust Graph Embedding with Spark

Many disjoint edges in topological graphs

Thrackles: An improved upper bound

Simple topological graphs

Active Subdivision Surfaces for the Semiautomatic Segmentation of Biomedical Volumes

Empty Triangles in Complete Topological Graphs

Saturated simple and k-simple topological graphs

Tree-cotree decomposition of isogeometric mortared spaces in H(curl) on multi-patch domains

Extrapolating Paths with Graph Neural Networks

Scaling a Reliable Distributed System